Spanning Cycles Through Specified Edges in Bipartite Graphs

DOI10.1002/jgt.20627zbMath1248.05097OpenAlexW2128268900MaRDI QIDQ2911049

Douglas B. West, M. Reza Zamani

Publication date: 12 September 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20627

zbMATH Keywords

Hamiltonian cycleHamiltonian graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Degree sum conditions for path-factors with specified end vertices in bipartite graphs ⋮ Stability in the Erdős-Gallai theorems on cycles and paths ⋮ Hamilton cycles passing through a matching in a bipartite graph with high degree sum ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Bipartite graphs with every matching in a cycle
• Pancyclic graphs and linear forests
• A look at cycles containing specified elements of a graph
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

This page was built for publication: Spanning Cycles Through Specified Edges in Bipartite Graphs