The (\(n\), \(k\))-extendable graphs in surfaces

DOI10.1007/s00373-019-02048-9zbMath1416.05231OpenAlexW2947834848WikidataQ127758315 ScholiaQ127758315MaRDI QIDQ2000587

Heping Zhang, Qiuli Li, Yushan Ma

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02048-9

zbMATH Keywords

\((ngraph in surfacek)\)-graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surface embedding of \((n,k)\)-extendable graphs
• 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
• On the restricted matching extension of graphs in surfaces
• The matching extendability of surfaces
• Matching extension and the genus of a graph
• On n-extendable graphs
• On the 2-extendability of planar graphs
• Extending matchings in graphs: A survey
• On the \(p\)-factor-criticality of the Klein bottle
• Das Geschlecht des vollständigen paaren Graphen
• On the matching extendability of graphs in surfaces
• On k-factor-critical graphs
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• Heawood's theorem and connectivity
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Generalization of matching extensions in graphs

This page was built for publication: The (\(n\), \(k\))-extendable graphs in surfaces