Hamiltonian Cycles and Uniquely Edge Colourable Graphs

Cited in

(82)

Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree
Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
Parity results on connected f-factors
On common edges in optimal solutions to traveling salesman and other optimization problems
Faces with large diameter on the symmetric traveling salesman polytope
Spanning cycles of nearly cubic graphs
Some graphic uses of an even number of odd nodes
The complexity of finding a second Hamiltonian cycle in cubic graphs
On the complexity of the parity argument and other inefficient proofs of existence
Interchange graphs and the Hamiltonian cycle polytope
Independent dominating sets and a second hamiltonian cycle in regular graphs
2-factor Hamiltonian graphs.
Vertices of small degree in uniquely Hamiltonian graphs
Hamiltonicity in locally finite graphs: two extensions and a counterexample
Hamilton cycles in infinite cubic graphs
Dual power assignment via second Hamiltonian cycle
Long cycles in Hamiltonian graphs
Rooted complete minors in line graphs with a Kempe coloring
Two conjectures on uniquely totally colorable graphs
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
2-D Tucker is PPA complete
A PPA parity theorem about trees in a bipartite graph
From one to many rainbow Hamiltonian cycles
Cycles containing all the odd-degree vertices
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
Understanding PPA-completeness
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
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
A note on kernels of intersecting families
Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs
On uniquely Hamiltonian claw-free and triangle-free graphs
Recent advances on the Hamiltonian problem: survey III
On the number of Hamiltonian cycles in bipartite graphs
On purely tree-colorable planar graphs
Euler complexes (oiks)
Uniquely Hamiltonian graphs of minimum degree 4
Cycle double covers in cubic graphs having special structures
Strong circuit double cover of some cubic graphs
On Sheehan's Conjecture for Graphs with Symmetry
Euler complexes
On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
scientific article; zbMATH DE number 3966100 (Why is no real title available?)
Circuit extension and circuit double cover of graphs
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
On the size and structure of graphs with a constant number of 1-factors
Hamilton weights and Petersen minors
The complexity of Thomason's algorithm for finding a second Hamiltonian cycle
\(4\)-regular \(4\)-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles
Regular graphs with few longest cycles
scientific article; zbMATH DE number 7559398 (Why is no real title available?)
Exploiting sparsity for bipartite Hamiltonicity
Graphs with few Hamiltonian cycles
Circuit double covers of graphs
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
Cycle decompositions of complete multigraphs
On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
K₂‐Hamiltonian graphs: II
The complexity of iterated reversible computation
Enumeration algorithm for the edge coloring problem on bipartite graphs
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
Few Hamiltonian cycles in graphs with one or two vertex degrees
Approximate and randomized algorithms for computing a second Hamiltonian cycle
On vertex-transitive graphs with a unique Hamiltonian cycle
Chords in longest cycles
On existence theorems
Another Hamiltonian cycle in bipartite Pfaffian graphs
On the girth and connectivity of cubic graphs with a unique longest cycle
Uniquely Hamiltonian graphs for many sets of degrees
What is on his mind?
Chords in longest cycles in 3-connected graphs
Removable edges and stability of 4-flow
Symmetry classes of Hamiltonian cycles
Hamiltonian cycles in subdivided doubles
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
Edge-coloured graphs with only monochromatic perfect matchings and their connection to quantum physics
Graphs uniquely Hamiltonian-connected from a vertex
On the black-box complexity of Sperner's Lemma
A data structure useful for finding Hamiltonian cycles
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Packing paths in complete graphs

This page was built for publication: Hamiltonian Cycles and Uniquely Edge Colourable Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4161352)