query: Hamiltonian in graph theory
positive_passages.docid: 25002
positive_passages.text: Is this true: any bipartite graph with unbalanced vertex parity is not Hamiltonian?
negative_passages.docid: 113015
negative_passages.text: Eulerian Paths in a Complete Graph $K_5$
negative_passages.docid: 139557
negative_passages.text: Why are the eigenvectors of the Laplacian of a ring graph sinusoidal?
negative_passages.docid: 142917
negative_passages.text: Graph vertex chromatic number in a union of 2 sub-graphs
negative_passages.docid: 78787
negative_passages.text: Circuit construction for Hamiltonian simulation
negative_passages.docid: 48692
negative_passages.text: A problem about the graph theory
negative_passages.docid: 19219
negative_passages.text: On the invertibility of the adjacency matrix of a graph
negative_passages.docid: 49465
negative_passages.text: How many Hamiltonian cycles are there in a complete graph $K_n$ ($n\geq 3$) Why?
negative_passages.docid: 43764
negative_passages.text: Prove $P_m X P_n$ is Hamiltonian if and only if at least one of $m,n$ is even
negative_passages.docid: 85628
negative_passages.text: If a graph has a Hamilton Path starting at every vertex, must it contain a Hamilton Circuit?
negative_passages.docid: 102539
negative_passages.text: Min. number of vertices in graph as function of $\kappa(G)$ and $\operatorname{diam}(G)$
negative_passages.docid: 27661
negative_passages.text: The closed graph theorem in topology
negative_passages.docid: 107943
negative_passages.text: Applications of Algebraic Topology to physics
negative_passages.docid: 83434
negative_passages.text: Graph theory induction
negative_passages.docid: 77697
negative_passages.text: Motivation for spectral graph theory.
negative_passages.docid: 125142
negative_passages.text: Example where Hamiltonian $H \neq T+V=E$, but $E=T+V$ is conserved
negative_passages.docid: 58081
negative_passages.text: Hamiltonian cycles in associahedron graphs