Notes on factor-criticality, extendibility and independence number
classification
🧮 math.CO
keywords
extendablefactor-criticalgraphsindependenceconditionextendibilityfactor-criticalityfrac
read the original abstract
In this paper, we give a sufficient and necessary condition for a $k$-extendable graph to be $2k$-factor-critical when $k=\nu/4$, and prove some results on independence numbers in $n$-factor-critical graphs and $k\frac{1}{2}$-extendable graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.