Sharp size and spectral-radius conditions guarantee that minimum-degree graphs are k-d-critical or satisfy the generalized factor-critical and bicritical properties.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
Sharp size and spectral-radius conditions guarantee that minimum-degree graphs are k-d-critical or satisfy the generalized factor-critical and bicritical properties.