Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:Graph_Theory_Concept
|
| gptkbp:alsoKnownAs |
Bigraphs
|
| gptkbp:characterizedBy |
2-colorable
No odd-length cycles |
| gptkbp:definedIn |
Graphs whose vertices can be divided into two disjoint sets such that every edge connects a vertex from one set to the other
|
| gptkbp:example |
Complete Bipartite Graph
Star Graph |
| gptkbp:hasProperty |
No edge connects vertices within the same set
|
| gptkbp:relatedTo |
gptkb:tree
gptkb:König's_Theorem Hall's Marriage Theorem Perfect Matching Planar Graphs |
| gptkbp:studiedIn |
gptkb:Discrete_Mathematics
Computer Science Combinatorics |
| gptkbp:usedIn |
gptkb:Network_Flow
Scheduling Recommendation Systems Matching Problems |
| gptkbp:bfsParent |
gptkb:Vertex_Cover
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bipartite Graphs
|