Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Recommendations
Cited in
(7)- Forcing faces in plane bipartite graphs
- Plane elementary bipartite graphs with forcing or anti-forcing edges
- Forcing and anti-forcing edges in bipartite graphs
- Removable and forced subgraphs of graphs
- Forcing faces in plane bipartite graphs. II
- Some tight bounds on the minimum and maximum forcing numbers of graphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
This page was built for publication: Conjugated circuits and forcing edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403547)
