Bounding the size of equimatchable graphs of fixed genus

DOI10.1007/s00373-008-0838-0zbMath1191.05033OpenAlexW2081466379MaRDI QIDQ1043800

Ken-ichi Kawarabayashi, Michael D. Plummer

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0838-0

zbMATH Keywords

matchingequimatchable graphsGallai-Edmonds decomposition theoremminimal imbedding

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 (7)

Equimatchable Graphs on Surfaces ⋮ Equimatchable claw-free graphs ⋮ Edge-stable equimatchable graphs ⋮ Unnamed Item ⋮ On two extensions of equimatchable graphs ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ Efficient recognition of equimatchable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On n-extendable graphs
• Matching-perfect and cover-perfect graphs
• On two equimatchable graph classes
• Das Geschlecht des vollständigen paaren Graphen
• On the matching extendability of graphs in surfaces
• Quelques consequences simples de la formule d'Euler
• Randomly matchable graphs
• Paths, Trees, and Flowers
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
• Existence of polyhedral embeddings of graphs

This page was built for publication: Bounding the size of equimatchable graphs of fixed genus