Extending matchings in planar graphs. IV
From MaRDI portal
Publication:686303
DOI10.1016/0012-365X(92)90292-NzbMATH Open0779.05035WikidataQ56003416 ScholiaQ56003416MaRDI QIDQ686303FDOQ686303
Authors: Michael D. Plummer
Publication date: 14 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Extending matchings in planar graphs. V
- Extending matchings in planar odd graphs.
- On restricted matching extension in planar graphs
- The matching extendability of optimal 1-planar graphs
- Extending matchings in graphs: A survey
- scientific article; zbMATH DE number 1161241
- Matchings and matching extensions in graphs
- Generalization of matching extensions in graphs. II.
- scientific article; zbMATH DE number 867631
- The extendability of matchings in strongly regular graphs
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
- Matching theory
- The Factorization of Linear Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On n-extendable graphs
- A Theorem on Planar Graphs
- A theorem on paths in planar graphs
- On the 2-extendability of planar graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on 1-factors in certain regular multigraphs
Cited In (23)
- Edge proximity and matching extension in punctured planar triangulations
- The 2-extendability of 5-connected graphs on surfaces with large representativity
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximity thresholds for matching extension in the torus and Klein bottle
- The matching extendability of optimal 1-planar graphs
- The 2-extendability of graphs on the projective plane, the torus and the Klein bottle
- On the 2-extendability of planar graphs
- Distance-restricted matching extension in planar triangulations
- The 2-extendability of 5-connected graphs on the Klein bottle
- Extending matchings in planar graphs. V
- Restricted matching in graphs of small genus
- Distance-restricted matching extension in triangulations of the torus and the Klein bottle
- On the matching extendability of graphs in surfaces
- Restricted matching in plane triangulations and near triangulations
- The (\(n\), \(k\))-extendable graphs in surfaces
- Matching Extension Missing Vertices and Edges in Triangulations of Surfaces
- Removal of subgraphs and perfect matchings in graphs on surfaces
- Proximity thresholds for matching extension in planar and projective planar triangulations
- Extending matchings in graphs: A survey
- The maximum matching extendability and factor-criticality of 1-planar graphs
- Extending matchings in claw-free graphs
This page was built for publication: Extending matchings in planar graphs. IV
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686303)