Removal of subgraphs and perfect matchings in graphs on surfaces
From MaRDI portal
Publication:6093152
DOI10.1002/jgt.22872zbMath1522.05360MaRDI QIDQ6093152
Publication date: 6 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Distance matching in punctured planar triangulations
- The 2-extendability of 5-connected graphs on surfaces with large representativity
- Extending matchings in planar graphs. IV
- Distance-restricted matching extension in triangulations of the torus and the Klein bottle
- The matching extendability of surfaces
- Matching extension and the genus of a graph
- A theorem on paths in locally planar triangulations
- Cycles in 5-connected triangulations
- On the matching extendability of graphs in surfaces
- Edge Proximity Conditions for Extendability in Planar Triangulations
- Proximity thresholds for matching extension in planar and projective planar triangulations
- Disjoint paths, planarizing cycles, and spanning walks
- Distance restricted matching extension missing vertices and edges in 5‐connected triangulations of the plane
- Edge proximity and matching extension in projective planar graphs
- Matching Extension Missing Vertices and Edges in Triangulations of Surfaces
This page was built for publication: Removal of subgraphs and perfect matchings in graphs on surfaces