A characterization of cycle-forced bipartite graphs

DOI10.1016/j.disc.2018.06.017zbMath1392.05067OpenAlexW2810453728WikidataQ129602650 ScholiaQ129602650MaRDI QIDQ724892

Ju Zhou, Xiumei Wang, Yi-pei Zhang

Publication date: 26 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.06.017

zbMATH Keywords

bipartite graphHamiltonian graphperfect matchingcycle-forced graph

Mathematics Subject Classification ID

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

Related Items (1)

Even cycles and perfect matchings in claw-free plane graphs

Cites Work

• On certain polytopes associated with graphs
• A characterization of PM-compact bipartite and near-bipartite graphs
• A characterization of PM-compact Hamiltonian bipartite graphs
• A note on PM-compact bipartite graphs
• A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS
• Unnamed Item

This page was built for publication: A characterization of cycle-forced bipartite graphs