Partition of a bipartite Hamiltonian graph into two cycles

DOI10.1016/0012-365X(86)90181-0zbMath0587.05044MaRDI QIDQ1072572

Denise Amar

Publication date: 1986

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

zbMATH Keywords

bipartite graphindependent cycles

Mathematics Subject Classification ID

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

Related Items (3)

On a conjecture on directed cycles in a directed bipartite graph ⋮ Partition of a directed bipartite graph into two directed cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Arc coverings of graphs
• On circuits in graphs
• A method in graph theory
• Pancyclic graphs. I
• On Hamiltonian bipartite graphs

This page was built for publication: Partition of a bipartite Hamiltonian graph into two cycles