Equimatchable Graphs on Surfaces
From MaRDI portal
Publication:3466352
DOI10.1002/jgt.21859zbMath1330.05126arXiv1312.3423OpenAlexW1952944845MaRDI QIDQ3466352
Publication date: 1 February 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.3423
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (7)
Edge-stable equimatchable graphs ⋮ Triangle‐free equimatchable graphs ⋮ Global forcing number for maximal matchings ⋮ Equimatchable Regular Graphs ⋮ Unnamed Item ⋮ On two extensions of equimatchable graphs ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
Cites Work
- On the restricted matching extension of graphs on the torus and the Klein bottle
- The 2-extendability of 5-connected graphs on surfaces with large representativity
- The matching extendability of surfaces
- Bounding the size of equimatchable graphs of fixed genus
- Matching-perfect and cover-perfect graphs
- On two equimatchable graph classes
- Das Geschlecht des vollständigen paaren Graphen
- Matchings in polytopal graphs
- Randomly matchable graphs
- Equimatchable factor‐critical graphs
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
This page was built for publication: Equimatchable Graphs on Surfaces
