Circuits through specified edges

DOI10.1016/0012-365X(82)90078-4zbMath0488.05048MaRDI QIDQ1165869

Roland Haeggkvist, Carsten Thomassen

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian circuitsindependent edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (25)

On a cycle through a specified linear forest of a graph ⋮ On circuits through five edges ⋮ Extensions to 2-factors in bipartite graphs ⋮ A degree condition for cycles passing through specified vertices and edges ⋮ An Improved Algorithm for Finding Cycles Through Elements ⋮ A degree sum condition for long cycles passing through a linear forest ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ Cycle double covers and spanning minors. I ⋮ The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ Cycles through five edges in 3-connected cubic graphs ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Cycles through four edges in 3-connected cubic graphs ⋮ Hamiltonian cycles and dominating cycles passing through a linear forest ⋮ Paths and cycles concerning independence edges ⋮ A look at cycles containing specified elements of a graph ⋮ Girth in graphs ⋮ Long cycles through a linear forest ⋮ A generalization of a theorem of Dirac ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture ⋮ Rooted topological minors on four vertices ⋮ A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs ⋮ A Chvátal-Erdős condition for (1,1)-factors in digraphs ⋮ Any four independent edges of a 4-connected graph are contained in a circuit

Cites Work

• Hamilton connected graphs
• Cycles through specified vertices of a graph
• Circuits containing specified edges
• Hamilton cycles in regular 2-connected graphs
• A remark on two sufficient conditions for Hamilton cycles
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• The binding number of a graph and its Anderson number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Circuits through specified edges