Every connected well-hued graph with a1 >= 3 and a2 = a1 + 2 is the corona of a complete graph, and nearly all connected well-hued graphs with independence number 2 are characterized.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Well-hued graphs with first difference two
Every connected well-hued graph with a1 >= 3 and a2 = a1 + 2 is the corona of a complete graph, and nearly all connected well-hued graphs with independence number 2 are characterized.