Large cycles in 4-connected graphs
Abstract
Every 4-connected graph G with minimum degree δ and connectivity either contains a cycle of length at least 4δ--4 or every longest cycle in G is a dominating cycle.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.