The 2-extendability of 5-connected graphs on surfaces with large representativity

DOI10.1016/j.jctb.2011.02.001zbMath1226.05202OpenAlexW2128988613MaRDI QIDQ536645

Ken-ichi Kawarabayashi, Yusuke Suzuki, Michael D. Plummer, Seiya Negami

Publication date: 19 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.02.001

zbMATH Keywords

surfacematchinggenusrepresentativity

Mathematics Subject Classification ID

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

Related Items (7)

Equimatchable Graphs on Surfaces ⋮ Edge proximity and matching extension in punctured planar triangulations ⋮ Removal of subgraphs and perfect matchings in graphs on surfaces ⋮ The matching extendability of optimal 1-planar graphs ⋮ The 2-extendability of 5-connected graphs on the Klein bottle ⋮ Distance-restricted matching extension in triangulations of the torus and the Klein bottle ⋮ Matching Extension Missing Vertices and Edges in Triangulations of Surfaces

Cites Work

• Unnamed Item
• The 2-extendability of graphs on the projective plane, the torus and the Klein bottle
• Extending matchings in planar graphs. IV
• The 2-extendability of 5-connected graphs on the Klein bottle
• The matching extendability of surfaces
• Matching extension and the genus of a graph
• Nonhamiltonian triangulations with large connectivity and representativity
• On the matching extendability of graphs in surfaces

This page was built for publication: The 2-extendability of 5-connected graphs on surfaces with large representativity