Minimally \(k\)-factor-critical graphs for some large \(k\)

DOI10.1007/s00373-023-02656-6zbMath1518.05153arXiv2207.03120OpenAlexW4376617939MaRDI QIDQ6115428

Heping Zhang, Jing Guo

Publication date: 12 July 2023

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

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

zbMATH Keywords

minimum degreeperfect matchingminimally \(k\)-factor-critical graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)

Related Items (1)

Minimum degree of minimal \((n-10)\)-factor-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On the structure of minimally \(n\)-extendable bipartite graphs
• Connectivity of \(k\)-extendable graphs with large \(k\).
• A closure concept in factor-critical graphs
• Closure and factor-critical graphs
• The characterization of \(p\)-factor-critical graphs
• How to build a brick
• Minimal bricks have many vertices of small degree
• Minimal bricks
• On k-factor-critical graphs
• Equivalence between Extendibility and Factor-Criticality
• Graph Factors and Matching Extensions
• Factor-criticality and matching extension in DCT-graphs
• The Cubic Vertices of Minimal Bricks
• On the structure of factorizable graphs
• The Factorization of Linear Graphs

This page was built for publication: Minimally \(k\)-factor-critical graphs for some large \(k\)