A characterization of cycle-forced bipartite graphs

DOI10.1016/J.DISC.2018.06.017zbMATH Open1392.05067OpenAlexW2810453728WikidataQ129602650 ScholiaQ129602650MaRDI QIDQ724892FDOQ724892

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 graphperfect matchingHamiltonian graphcycle-forced graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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

Cited In (2)

• Removable and forced subgraphs of graphs
• Even cycles and perfect matchings in claw-free plane graphs

   Recommendations

• Cyclability in bipartite graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Cyclability and pancyclability in bipartite graphs 👍 👎
• On the cyclic decomposition of circulant graphs into bipartite graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Forcing and anti-forcing edges in bipartite graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Bounds on the forcing numbers of bipartite graphs 👍 👎
• On independent cycles in a bipartite graph 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724892)