Minimum degree of minimal k-factor-critical triangle-free graphs with k n - 83

DOI10.1016/J.DAM.2026.03.051MaRDI QIDQ7238600zbMATH OpenFDO

Authors Xiao Zhao, Yizhen Mao

Publication date 8 May 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.03.051

zbMATH Keywords

\(k\)-factor-criticalminimum degreetriangle-free

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35)

Cites work

• Cubic vertices of minimal bicritical graphs
• scientific article; zbMATH DE number 1191210 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• Minimally k-factor-critical graphs for some large k
• Minimum degree of minimal (n-10)-factor-critical graphs
• On k-factor-critical graphs
• The Factorization of Linear Graphs

This page was built for publication: Minimum degree of minimal \(k\)-factor-critical triangle-free graphs with \(k \geq \frac{n - 8}{3}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238600)