On Minimal k‐Factor‐Critical Planar Graphs
Abstract
ABSTRACT A graph of order is said to be ‐factor‐critical () if the removal of any vertices results in a graph with a perfect matching. A ‐factor‐critical graph is minimal if is not ‐factor‐critical for any edge in . Favaron and Shi posed the conjecture that every minimal ‐factor‐critical graph is of minimum degree in 1998. In this paper, we confirm the conjecture for planar graphs.
Fields of Study & Subjects
Advanced Graph Theory Research
Computational Geometry and Mesh Generation
Structural Analysis and Optimization
Publication details
- Journal / source
- Journal of Graph Theory
- Publication date
- 13 June 2026
- Language
- EN