Some novel minimax results for perfect matchings of hexagonal systems
From MaRDI portal
Publication:2166259
DOI10.1016/j.dam.2022.06.017zbMath1495.05272arXiv2009.10394MaRDI QIDQ2166259
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.10394
05C30: Enumeration in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05C92: Chemical graph theory
Cites Work
- Uniquely forced perfect matching and unique 3-edge-coloring
- Anti-forcing spectra of perfect matchings of graphs
- Extremal anti-forcing numbers of perfect matchings of graphs
- Packing directed circuits exactly
- Hexagonal systems with forcing single edges
- Unimodularity of the Clar number problem
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- A maximal cover of hexagonal systems
- The minimum forcing number for the torus and hypercube
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- The minimum forcing number of perfect matchings in the hypercube
- Z-transformation graphs of perfect matchings of hexagonal systems
- On the forced matching numbers of bipartite graphs
- Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
- Hexagonal systems with forcing edges
- Relations between global forcing number and maximum anti-forcing number of a graph
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
- On the anti-forcing number of benzenoids
- Tight upper bound on the maximum anti-forcing numbers of graphs
- Perfect matchings in hexagonal systems
- Anti-forcing numbers of perfect matchings of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
