Relations between global forcing number and maximum anti-forcing number of a graph
DOI10.1016/j.dam.2022.01.010zbMath1483.05135arXiv2009.05746OpenAlexW3086488478MaRDI QIDQ2078844
Publication date: 4 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.05746
perfect matchingperfect matching polytopeglobal forcing numberBirkhoff-von Neumann graphmaximum anti-forcing numbersolid brick
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A maximum resonant set of polyomino graphs
- A minimax result for perfect matchings of a polyomino graph
- Anti-forcing spectra of perfect matchings of graphs
- Extremal anti-forcing numbers of perfect matchings of graphs
- Hexagonal systems with forcing single edges
- The perfect matching polytope and solid bricks
- The global forcing number of the parallelogram polyhex
- On the global forcing number of hexagonal systems
- A simpler proof for the two disjoint odd cycles theorem
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- Brick decompositions and the matching rank of graphs
- Matching theory
- Matching structure and the matching lattice
- The minimum forcing number for the torus and hypercube
- Forcing matchings on square grids
- The minimum forcing number of perfect matchings in the hypercube
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- A generalization of Little's theorem on Pfaffian orientations
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
- How to build a brick
- On the anti-forcing number of benzenoids
- Global forcing number of benzenoid graphs
- On Two Unsolved Problems Concerning Matching Covered Graphs
- Integer and Fractional Matchings
- Tight upper bound on the maximum anti-forcing numbers of graphs
- Disjoint Odd Cycles in Cubic Solid Bricks
- Birkhoff--von Neumann Graphs that are PM-Compact
- Maximum matching and a polyhedron with 0,1-vertices
- Anti-forcing numbers of perfect matchings of graphs
This page was built for publication: Relations between global forcing number and maximum anti-forcing number of a graph
