Proof of a conjecture of Haeggkvist on cycles and independent edges

DOI10.1016/0012-365X(83)90264-9zbMath0513.05033WikidataQ123154105 ScholiaQ123154105MaRDI QIDQ1050353

Kenneth A. Berman

Publication date: 1983

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

zbMATH Keywords

independent edgesdegree-condition

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (12)

Bipartite graphs with every matching in a cycle ⋮ Extensions to 2-factors in bipartite graphs ⋮ A degree condition for cycles passing through specified vertices and edges ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Unnamed Item ⋮ Graphs with every matching contained in a cycle ⋮ Removable matchings and Hamiltonian cycles ⋮ A degree condition implying that every matching is contained in a Hamiltonian cycle ⋮ On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs ⋮ A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph ⋮ On 2-factors containing 1-factors in bipartite graphs ⋮ Hamiltonian cycles and paths through matchings

Cites Work

• Hamilton connected graphs
• Note on Hamilton Circuits
• Sufficient Conditions for Circuits in Graphs^†
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of a conjecture of Haeggkvist on cycles and independent edges