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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Determines sharp extremal edge bounds and complete structural characterizations for 2-connected graphs avoiding cycles congruent to 1 mod 3 (and 2 mod 4), completing the general-case picture for k=3.
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.
-
On 2-connected graphs without cycles of length 1 modulo 3
Determines sharp extremal edge bounds and complete structural characterizations for 2-connected graphs avoiding cycles congruent to 1 mod 3 (and 2 mod 4), completing the general-case picture for k=3.