query: Finding a cycle in a 3-partite graph
positive_passages.docid: 23916
positive_passages.text: Does 3-partite graph with at least n+1 edges per vertex have a triangle?
negative_passages.docid: 91229
negative_passages.text: Complexity of counting the number of triangles of a graph
negative_passages.docid: 59203
negative_passages.text: isomorphic planar graph with its complement
negative_passages.docid: 72417
negative_passages.text: Bipartite graphs
negative_passages.docid: 8458
negative_passages.text: Combinatorics problem based on Ferrers graph
negative_passages.docid: 146016
negative_passages.text: no cycles if and only if has $n-m$ connected components
negative_passages.docid: 49193
negative_passages.text: Constructing a graph from a degree sequence
negative_passages.docid: 58587
negative_passages.text: 3-regular graphs with no bridges
negative_passages.docid: 146933
negative_passages.text: Proving bipartition in a connected planar graph
negative_passages.docid: 51002
negative_passages.text: Regular graph (Homework)
negative_passages.docid: 82578
negative_passages.text: Show that if $G$ is $2-$connected, then for any two vertices $u$ and $v$ there exists a cycle $C$ such that $u, v \in V (C)$
negative_passages.docid: 71170
negative_passages.text: Upper Bound on the Chromatic Number of a Graph with No Two Disjoint Odd Cycles
negative_passages.docid: 9847
negative_passages.text: Prove that if every node in a simple graph $G$ has degree $3$ or higher, then $G$ contains a cycle with a chord.
negative_passages.docid: 113015
negative_passages.text: Eulerian Paths in a Complete Graph $K_5$
negative_passages.docid: 142917
negative_passages.text: Graph vertex chromatic number in a union of 2 sub-graphs
negative_passages.docid: 56092
negative_passages.text: What is complexity of this max-edge subgraph problem?
negative_passages.docid: 17868
negative_passages.text: How to calculate the number of possible connected simple graphs with $n$ labelled vertices