On the restricted matching extension of graphs on the torus and the Klein bottle
From MaRDI portal
Publication:442346
DOI10.1016/j.disc.2012.04.011zbMath1246.05131MaRDI QIDQ442346
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.011
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Restricted 2-extendability of (3,6)-fullerenes, Binding numbers and restricted fractional \(( g , f )\)-factors in graphs, Toughness, binding number and restricted matching extension in a graph, Equimatchable Graphs on Surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes
- The matching extendability of surfaces
- A complete characterization for \(k\)-resonant Klein-bottle polyhexes
- Lexicographic product of extendable graphs
- Restricted matching in graphs of small genus
- Matching extension and the genus of a graph
- On n-extendable graphs
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
- A note on extendability and factor-criticality
- Toughness and matching extension in graphs
- Extendability and factor-criticality
- Hamiltonian circuits in some maps on the torus
- Construction and enumeration of regular maps on the torus
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- On restricted matching extension in planar graphs