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

DOI10.1016/j.disc.2023.113839arXiv2211.02933MaRDI QIDQ6197704

Jing Guo, Heping Zhang

Publication date: 19 February 2024

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Brick decompositions and the matching rank of graphs
• Matching structure and the matching lattice
• 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
• Graph Theory
• Equivalence between Extendibility and Factor-Criticality
• Graph Factors and Matching Extensions
• The Cubic Vertices of Minimal Bricks
• On the structure of factorizable graphs
• The Factorization of Linear Graphs
• Minimally \(k\)-factor-critical graphs for some large \(k\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum degree of minimal \((n-10)\)-factor-critical graphs