Forcing and anti-forcing edges in bipartite graphs

DOI10.1016/j.dam.2018.03.027zbMath1387.05127OpenAlexW2795052996MaRDI QIDQ1752588

Zhongyuan Che, Zhibo Chen

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.027

zbMATH Keywords

forcing single edge\(e\)-anti-forcing path\(e\)-forcing pathanti-forcing edgeforcing double edgeforcing edge

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (1)

Plane elementary bipartite graphs with forcing or anti-forcing edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniquely forced perfect matching and unique 3-edge-coloring
• Anti-forcing spectra of perfect matchings of graphs
• Hexagonal systems with forcing single edges
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Forcing matching numbers of fullerene graphs
• Z-transformation graphs of perfect matchings of hexagonal systems
• Hexagonal systems with forcing edges
• On the anti-forcing number of benzenoids
• On the anti-forcing number of fullerene graphs
• Anti-forcing numbers of perfect matchings of graphs

This page was built for publication: Forcing and anti-forcing edges in bipartite graphs