Extending cycles in bipartite graphs

DOI10.1016/0095-8956(91)90044-KzbMath0674.05044OpenAlexW2090973002MaRDI QIDQ1121281

George R. T. Hendry

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0095-8956(91)90044-k

zbMATH Keywords

cyclebipartite graphHamiltonian

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

Spectral conditions for traceability of connected claw-free graphs ⋮ Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ On Ore-type sufficient condition for a bipancyclic ordering ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ Extending cycles in graphs ⋮ Bi-cycle extendable through a given set in balanced bipartite graphs ⋮ Energy conditions for Hamiltonicity of graphs ⋮ Signless Laplacian spectral conditions for Hamiltonicity of graphs

Cites Work

• Extending cycles in graphs
• A method in graph theory
• On Hamiltonian bipartite graphs
• The multiplicity of 1-factors in the square of a graph
• Bipartite graphs with cycles of all even lengths
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending cycles in bipartite graphs