Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs

Abstract

We show that a cubic graph G of order n has an induced 2-regular subgraph of order at least a) n-24-4k, if G has no induced cycle of length more than k, b) 5n+68, if G has no induced cycle of length more than 4, and n>6, and c) (14+ε)n, if the independence number of G is at most (38-ε)n. To show the second result we give a precise structural description of cubic 4-chordal graphs.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…