The paper gives a complete characterization of the exceptional graphs with min-degree 2 and at most three degree-2 vertices that have no cycle length divisible by 3 or by 4.
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
-
Existence of cycles of length divisible by 3 or 4
The paper gives a complete characterization of the exceptional graphs with min-degree 2 and at most three degree-2 vertices that have no cycle length divisible by 3 or by 4.