On the anti-Kekulé number and odd cycle transversal of regular graphs
From MaRDI portal
Publication:2446864
Recommendations
Cites work
- A note on the cyclical edge-connectivity of fullerene graphs
- Bipartizing fullerenes
- Computing the bipartite edge frustration of fullerene graphs
- Cyclical edge-connectivity of fullerene graphs and (k,6)-cages
- Extremal bipartite subgraphs of cubic triangle-free graphs
- Maximum bipartite subgraphs of cubic triangle-free planar graphs
- Odd Cycle Transversals and Independent Sets in Fullerene Graphs
- On some extremal problems in graph theory
- On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- On the anti-Kekulé number of fullerenes
- On the anti-Kekulé number of leapfrog fullerenes
- 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
- The Factorization of Linear Graphs
Cited in
(6)
This page was built for publication: On the anti-Kekulé number and odd cycle transversal of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446864)