Plane elementary bipartite graphs with forcing or anti-forcing edges

DOI10.1007/S00373-019-02051-0zbMATH Open1416.05075OpenAlexW2947644803WikidataQ127768387 ScholiaQ127768387MaRDI QIDQ2000588FDOQ2000588

Zhongyuan Che, Zhibo Chen

Publication date: 28 June 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02051-0

zbMATH Keywords

forcing faceforcing double edgeforcing edgeplane minimal elementary bipartite graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Plane elementary bipartite graphs
• Hexagonal systems with forcing edges
• Hexagonal systems with forcing single edges
• On the anti-forcing number of benzenoids
• Anti-forcing spectra of perfect matchings of graphs
• On the anti-forcing number of fullerene graphs
• Anti-forcing numbers of perfect matchings of graphs
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Forcing and anti-forcing edges in bipartite graphs
• Forcing faces in plane bipartite graphs. II
• Forcing faces in plane bipartite graphs

Cited In (1)

• On plane bipartite graphs without fixed edges

This page was built for publication: Plane elementary bipartite graphs with forcing or anti-forcing edges

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