A characterization of cycle-forced bipartite graphs

DOI10.1016/J.DISC.2018.06.017MaRDI QIDQ724892zbMATH OpenOpenAlexWikidataFDO

Authors Xiumei Wang, Ju Zhou, 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)

Recommendations

• Cyclability in bipartite graphs
• scientific article; zbMATH DE number 1093015
• Cyclability and pancyclability in bipartite graphs
• On the cyclic decomposition of circulant graphs into bipartite graphs
• scientific article; zbMATH DE number 4106890
• scientific article; zbMATH DE number 3946168
• Forcing and anti-forcing edges in bipartite graphs
• scientific article; zbMATH DE number 3895104
• Bounds on the forcing numbers of bipartite graphs
• On independent cycles in a bipartite graph

Cites work

• A characterization of PM-compact Hamiltonian bipartite graphs
• A characterization of PM-compact bipartite and near-bipartite graphs
• A characterization of PM-compact claw-free cubic graphs
• A note on PM-compact bipartite graphs
• Graph theory
• On certain polytopes associated with graphs

Cited in

(2)

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

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)