Hamiltonian Cycles and Uniquely Edge Colourable Graphs
From MaRDI portal
Publication:4161352
DOI10.1016/S0167-5060(08)70511-9zbMath0382.05039OpenAlexW1504855246WikidataQ55894233 ScholiaQ55894233MaRDI QIDQ4161352
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70511-9
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items
Parity results on connected f-factors, On the complexity of the parity argument and other inefficient proofs of existence, On purely tree-colorable planar graphs, On the black-box complexity of Sperner's Lemma, Hamilton weights and Petersen minors, On common edges in optimal solutions to traveling salesman and other optimization problems, Regular Graphs with Few Longest Cycles, Cycle Double Covers in Cubic Graphs having Special Structures, Hamiltonicity in locally finite graphs: two extensions and a counterexample, Hamilton cycles in infinite cubic graphs, Cycles containing all the odd-degree vertices, THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE, Interchange graphs and the Hamiltonian cycle polytope, Strong Circuit Double Cover of Some Cubic Graphs, A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three, Independent dominating sets and a second hamiltonian cycle in regular graphs, Circuit extension and circuit double cover of graphs, On Sheehan's Conjecture for Graphs with Symmetry, Dual power assignment via second Hamiltonian cycle, On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs, On the size and structure of graphs with a constant number of 1-factors, 2-factor Hamiltonian graphs., 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles, K2‐Hamiltonian graphs: II, A data structure useful for finding Hamiltonian cycles, Euler Complexes, Understanding PPA-completeness, Recent advances on the Hamiltonian problem: survey III, Long cycles in Hamiltonian graphs, Not being (super)thin or solid is hard: A study of grid Hamiltonicity, Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search, The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges, The complexity of counting edge colorings for simple graphs, A parity theorem about trees with specified degrees, A short note on graphs with long Thomason chains, Rooted complete minors in line graphs with a Kempe coloring, Chords in longest cycles, On existence theorems, Faces with large diameter on the symmetric traveling salesman polytope, Packing paths in complete graphs, 2-D Tucker is PPA complete, Unnamed Item, What is on his mind?, On the Number of Hamiltonian Cycles in Bipartite Graphs, Unnamed Item, Enumeration of Hamiltonian cycles in certain generalized Petersen graphs, A note on kernels of intersecting families, Unnamed Item, Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs, Spanning cycles of nearly cubic graphs, Graphs with few hamiltonian cycles, Unnamed Item, Cycle decompositions of complete multigraphs, Two conjectures on uniquely totally colorable graphs, Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree, A PPA parity theorem about trees in a bipartite graph, Vertices of small degree in uniquely Hamiltonian graphs, Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles, Some graphic uses of an even number of odd nodes, Circuit Double Covers of Graphs, Graphs uniquely Hamiltonian-connected from a vertex, The complexity of finding a second Hamiltonian cycle in cubic graphs, On uniquely Hamiltonian claw-free and triangle-free graphs, From one to many rainbow Hamiltonian cycles, On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles, Uniquely Hamiltonian Graphs of Minimum Degree 4, Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
