On Hamilton's ideals
From MaRDI portal
Publication:2545100
DOI10.1016/0095-8956(72)90020-2zbMath0213.50803MaRDI QIDQ2545100
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90020-2
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, A note on the edge reconstruction conjecture, Unnamed Item, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, Recent results on the total chromatic number, On existence theorems, Computation of the 0-dual closure for hamiltonian graphs, Covering the vertices of a digraph by cycles of prescribed length, Stable properties of graphs, On Ore-type sufficient condition for a bipancyclic ordering, A condition for a Hamiltonian bipartite graph to be bipancyclic, The chromatic index of a graph whose core has maximum degree two, On n-Hamiltonian graphs, A method in graph theory, Sur les arborescences dans un graphe oriente, Panconnected graphs. II, Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences, Locally pancyclic graphs, Degree maximal graphs are Laplacian integral, Longest cycles in threshold graphs, Vertex-splitting and chromatic index critical graphs, A new Chvátal type condition for pancyclicity, Pancyclic graphs and a conjecture of Bondy and Chvatal, On a generalization of Chvátal's condition giving new Hamiltonian degree sequences, Hamiltonian arcs in self-complementary graphs, Hamiltonian degree conditions for tough graphs, Sufficient conditions for a graph to be Hamiltonian, Hamiltonian lines in infinite graphs with few vertices of smll valency, Note on Hamilton circuits and Hamilton paths, Tough graphs and Hamiltonian circuits., The strongest monotone degree condition for \(n\)-connectedness of a graph, Some recent results in hamiltonian graphs
Cites Work
