The matching extendability of surfaces

DOI10.1016/0095-8956(92)90071-5zbMath0707.05051OpenAlexW2058404515MaRDI QIDQ918993

Nathaniel Dean

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90071-5

zbMATH Keywords

matching extendabilityprojective planar graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (20)

On the \(p\)-factor-criticality of the Klein bottle ⋮ Equimatchable Graphs on Surfaces ⋮ Edge proximity and matching extension in punctured planar triangulations ⋮ High girth and extendability ⋮ The 2-extendability of graphs on the projective plane, the torus and the Klein bottle ⋮ Removal of subgraphs and perfect matchings in graphs on surfaces ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ Matching extension and distance spectral radius ⋮ On the restricted matching extension of graphs on the torus and the Klein bottle ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ On the matching extendability of graphs in surfaces ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes ⋮ The 2-extendability of 5-connected graphs on surfaces with large representativity ⋮ The 2-extendability of 5-connected graphs on the Klein bottle ⋮ On the restricted matching extension of graphs in surfaces ⋮ Restricted matching in graphs of small genus ⋮ 2-extendability of toroidal polyhexes and Klein-bottle polyhexes ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ Extending matchings in graphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending subpermutation matrices in regular classes of matrices
• Matching extension and the genus of a graph
• On n-extendable graphs
• A Theorem on Planar Graphs
• Polytopes, graphs, and complexes
• The Triangulation of Surfaces and the Heawood Color Formula
• A theorem on paths in planar graphs

This page was built for publication: The matching extendability of surfaces