Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs

DOI10.1007/s00373-011-1045-yzbMath1256.05199arXiv1707.07288OpenAlexW2114712088MaRDI QIDQ1926044

Zan-Bo Zhang, Xiaoyan Zhang, Xuelian Wen, Dingjun Lou

Publication date: 27 December 2012

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

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

zbMATH Keywords

minimum size\(k\)-extendable\(n\)-factor-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Minimum \(k\)-critical bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• Extending matchings in graphs: A survey
• Connectivity of \(k\)-extendable graphs with large \(k\).
• New lower bound on the number of perfect matchings in fullerene graphs
• Independence number in \(n\)-extendable graphs
• On k-factor-critical graphs
• Equivalence between Extendibility and Factor-Criticality
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• A Note on n-Critical Bipartite Graphs and Its Application
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs