k-γ_c-critical graphs are traceable iff they have at least k-3 cut-vertices (for k≥4 and ζ≤k-2).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Traceability of Connected Domination Critical Graphs
k-γ_c-critical graphs are traceable iff they have at least k-3 cut-vertices (for k≥4 and ζ≤k-2).