Matching extension and the genus of a graph

DOI10.1016/0095-8956(88)90041-XzbMath0653.05054OpenAlexW2985639584MaRDI QIDQ1107545

Michael D. Plummer

Publication date: 1988

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(88)90041-x

zbMATH Keywords

genusextendable graphsperfect matching

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (22)

On the \(p\)-factor-criticality of the Klein bottle ⋮ On 2-extendable abelian Cayley graphs ⋮ 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 ⋮ The matching extendability of surfaces ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ 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 ⋮ On the extendability of certain semi-Cayley graphs of finite Abelian groups ⋮ On 2-extendable quasi-abelian Cayley graphs ⋮ Toughness and matching extension in graphs ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness ⋮ Extending matchings in graphs: A survey ⋮ Extending matchings in claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relationship between the genus and the cardinality of the maximum matchings of a graph
• Ear-decompositions of matching-covered graphs
• Matching theory
• On n-extendable graphs
• On minimal elementary bipartite graphs
• Heawood's theorem and connectivity
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: Matching extension and the genus of a graph