The 2-extendability of 5-connected graphs on the Klein bottle

DOI10.1016/j.disc.2010.06.020zbMath1230.05240OpenAlexW1974624599MaRDI QIDQ708419

Yusuke Suzuki, Seiya Negami

Publication date: 11 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.020

zbMATH Keywords

matchingextendabilitythe Klein bottle

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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Proximity thresholds for matching extension in the torus and Klein bottle ⋮ Nilpotent graphs with crosscap at most two ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ The 2-extendability of 5-connected graphs on surfaces with large representativity

Cites Work

• The 2-extendability of 5-connected graphs on surfaces with large representativity
• The 2-extendability of graphs on the projective plane, the torus and the Klein bottle
• Extending matchings in planar graphs. IV
• The matching extendability of surfaces
• Restricted matching in graphs of small genus
• Matching extension and the genus of a graph
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• On the matching extendability of graphs in surfaces
• Unnamed Item
• Unnamed Item

This page was built for publication: The 2-extendability of 5-connected graphs on the Klein bottle