On the anti-Kekulé problem of cubic graphs
From MaRDI portal
Publication:5198031
DOI10.26493/2590-9770.1264.94bzbMath1421.05032arXiv1711.05398OpenAlexW2963539504MaRDI QIDQ5198031
Qiuli Li, Wai Chee Shiu, Pak Kiu Sun, Dong Ye
Publication date: 2 October 2019
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.05398
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hexagonal resonance of (3,6)-fullerenes
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- On forcing matching number of boron-nitrogen fullerene graphs
- A note on the cyclical edge-connectivity of fullerene graphs
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- Forcing matching numbers of fullerene graphs
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- On the anti-Kekulé number of leapfrog fullerenes
- Spectra of toroidal graphs
- Hamiltonian circuits in polytopes with even sided faces
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Geometry and topology induced electronic properties of graphene derived quantum systems
- On the anti-Kekulé number and odd cycle transversal of regular graphs
- The Anti-Kekule number of the infinite triangular, rectangular and hexagonal grids
- Onk-Resonant Fullerene Graphs
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- A class of Hamiltonian polytopes
- Faster scaling algorithms for general graph matching problems
- Paths, Trees, and Flowers
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- The Factorization of Linear Graphs
This page was built for publication: On the anti-Kekulé problem of cubic graphs
