Distance-restricted matching extension in triangulations of the torus and the Klein bottle
From MaRDI portal
Publication:743652
zbMath1301.05257MaRDI QIDQ743652
Publication date: 30 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p39
triangulationtoroidal graphdistance-restricted matching extensionKlein-bottle graphnon-contractible cycleseparating cycle
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
Toughness, binding number and restricted matching extension in a graph, Edge proximity and matching extension in punctured planar triangulations, Removal of subgraphs and perfect matchings in graphs on surfaces, Distance-restricted matching extendability of fullerene graphs, Distance matching extension in cubic bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity thresholds for matching extension in the torus and Klein bottle
- The 2-extendability of 5-connected graphs on surfaces with large representativity
- The 2-extendability of graphs on the projective plane, the torus and the Klein bottle
- Extending matchings in planar graphs. IV
- Distance-restricted matching extension in planar triangulations
- Restricted matching in graphs of small genus
- Proximity thresholds for matching extension in planar and projective planar triangulations