On the anti-Kekulé number and odd cycle transversal of regular graphs

DOI10.1016/j.dam.2013.03.014zbMath1287.05123OpenAlexW1990492857WikidataQ114191528 ScholiaQ114191528MaRDI QIDQ2446864

Dong Ye

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.014

zbMATH Keywords

fullerenesperfect matchingsodd cycle transversalanti-Kekulé number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (4)

The anti-Kekulé number of graphs ⋮ On the anti-Kekulé number of (4, 5, 6)-fullerenes ⋮ Unnamed Item ⋮ On the anti-Kekulé problem of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Bipartizing fullerenes
• A note on the cyclical edge-connectivity of fullerene graphs
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• On the anti-Kekulé number of leapfrog fullerenes
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Computing the bipartite edge frustration of fullerene graphs
• On some extremal problems in graph theory
• On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
• The Anti-Kekule number of the infinite triangular, rectangular and hexagonal grids
• Extremal bipartite subgraphs of cubic triangle-free graphs
• Odd Cycle Transversals and Independent Sets in Fullerene Graphs
• The Factorization of Linear Graphs

This page was built for publication: On the anti-Kekulé number and odd cycle transversal of regular graphs