Surface embedding of \((n,k)\)-extendable graphs

DOI10.1016/j.dam.2014.08.003zbMath1303.05157arXiv1408.4046OpenAlexW2085774909MaRDI QIDQ477346

David G. L. Wang, Hongliang Lu

Publication date: 3 December 2014

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

Full work available at URL: https://arxiv.org/abs/1408.4046

zbMATH Keywords

Euler contributionfactor-criticalitymatching extendabilitysurface embedding

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

The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs

Cites Work

• Unnamed Item
• 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
• The matching extendability of surfaces
• Matching extension and the genus of a graph
• On n-extendable graphs
• Pairs of Hamiltonian circuits in 5-connected planar graphs
• Connectivity of \(k\)-extendable graphs with large \(k\).
• On the \(p\)-factor-criticality of the Klein bottle
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Generalization of matching extensions in graphs
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen

This page was built for publication: Surface embedding of \((n,k)\)-extendable graphs