Plane elementary bipartite graphs with forcing or anti-forcing edges
From MaRDI portal
(Redirected from Publication:2000588)
Recommendations
Cites work
- Anti-forcing numbers of perfect matchings of graphs
- Anti-forcing spectra of perfect matchings of graphs
- Conjugated circuits and forcing edges
- Forcing and anti-forcing edges in bipartite graphs
- Forcing faces in plane bipartite graphs
- Forcing faces in plane bipartite graphs. II
- Forcing hexagons in hexagonal systems
- Hexagonal systems with forcing edges
- Hexagonal systems with forcing single edges
- scientific article; zbMATH DE number 168170 (Why is no real title available?)
- scientific article; zbMATH DE number 6127683 (Why is no real title available?)
- Matching theory
- On the anti-forcing number of benzenoids
- On the anti-forcing number of fullerene graphs
- On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- Plane elementary bipartite graphs
- The anti-forcing number of double hexagonal chains
- The anti-forcing number of hexagonal chains
Cited in
(5)- Forcing faces in plane bipartite graphs. II
- Forcing faces in plane bipartite graphs
- On plane bipartite graphs without fixed edges
- 1-factors and characterization of reducible faces of plane elementary bipartite graphs
- Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
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)