complete bipartite graph K3,3
GPTKB entity
Statements (31)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:bipartite_graph
gptkb:complete_bipartite_graph gptkb:graph |
| gptkbp:automorphismGroup |
S3 × S3 × Z2
|
| gptkbp:chromaticNumber |
2
3 |
| gptkbp:degreeOfEachVertex |
3
|
| gptkbp:girth |
4
|
| gptkbp:hasConnection |
true
|
| gptkbp:hasEdgeCount |
9
|
| gptkbp:hasHamiltonianCycle |
false
|
| gptkbp:hasPartitionSizes |
3,3
|
| gptkbp:hasPerfectMatching |
true
|
| gptkbp:hasVertexCount |
6
|
| gptkbp:isBipartite |
true
|
| gptkbp:isEdgeTransitive |
true
|
| gptkbp:isMinorOf |
non-planar graphs
|
| gptkbp:isNonPlanarReason |
gptkb:Kuratowski's_theorem
|
| gptkbp:isPlanar |
false
|
| gptkbp:isRegular |
true
|
| gptkbp:isSelfComplementary |
false
|
| gptkbp:isSimple |
true
|
| gptkbp:isSubgraphOf |
K3,3,1
|
| gptkbp:isTriangleFree |
true
|
| gptkbp:isVertexTransitive |
true
|
| gptkbp:numberOfIssues |
true
|
| gptkbp:symmetry |
true
|
| gptkbp:usedIn |
gptkb:Kuratowski's_theorem
graph theory planarity testing |
| https://www.w3.org/2000/01/rdf-schema#label |
complete bipartite graph K3,3
|