query: A characterisation of planar complete $k$-partite graphs
positive_passages.docid: 142861
positive_passages.text: Multipartite graphs which are not planar
negative_passages.docid: 48692
negative_passages.text: A problem about the graph theory
negative_passages.docid: 117707
negative_passages.text: d-regular bipartite graph
negative_passages.docid: 91229
negative_passages.text: Complexity of counting the number of triangles of a graph
negative_passages.docid: 134938
negative_passages.text: Committee combinatorics
negative_passages.docid: 72417
negative_passages.text: Bipartite graphs
negative_passages.docid: 116538
negative_passages.text: Proof of Connected Diagrams
negative_passages.docid: 107899
negative_passages.text: counting full bipartite matchings
negative_passages.docid: 59831
negative_passages.text: How to relate combinatorial proof to bipartite graphs?
negative_passages.docid: 70761
negative_passages.text: Number of ways to connect sets of $k$ dots in a perfect $n$-gon
negative_passages.docid: 100466
negative_passages.text: The number of labelled graphs with all vertices of even degree
negative_passages.docid: 33373
negative_passages.text: Balanced orientation of infinite graphs
negative_passages.docid: 149538
negative_passages.text: graph theory - clique graph
negative_passages.docid: 158802
negative_passages.text: Graph theory and tree company
negative_passages.docid: 85541
negative_passages.text: What is the maximum length of a circuit in the complete graph on n vertices.
negative_passages.docid: 65622
negative_passages.text: Maximum edges in a square free graph
negative_passages.docid: 23916
negative_passages.text: Does 3-partite graph with at least n+1 edges per vertex have a triangle?