Cycles containing all the odd-degree vertices

DOI10.1016/j.jctb.2019.12.003zbMath1437.05125OpenAlexW2997471932MaRDI QIDQ2173434

Carsten Thomassen, Kathie Cameron

Publication date: 22 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2019.12.003

zbMATH Keywords

Hamiltonian cycleEulerian graphparity theoremlifting a vertex

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Cycles containing all the odd-degree vertices ⋮ A parity theorem about trees with specified degrees ⋮ A PPA parity theorem about trees in a bipartite graph

Cites Work

• Unnamed Item
• Chords in longest cycles
• Recharacterizing Eulerian: Intimations of new duality
• Elementary proofs of (relatively) recent characterizations of Eulerian graphs
• Properties of a Euler graph
• Some graphic uses of an even number of odd nodes
• A PPA parity theorem about trees in a bipartite graph
• Cycles containing all the odd-degree vertices
• Parity theorems for paths and cycles in graphs
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• On Hamiltonian Circuits

This page was built for publication: Cycles containing all the odd-degree vertices