Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs
Combinatorics
2014-06-11 v1
Abstract
We show that a cubic graph of order has an induced -regular subgraph of order at least a) , if has no induced cycle of length more than , b) , if has no induced cycle of length more than , and , and c) , if the independence number of is at most . To show the second result we give a precise structural description of cubic -chordal graphs.
Keywords
Cite
@article{arxiv.1406.2438,
title = {Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs},
author = {Michael A. Henning and Felix Joos and Christian Löwenstein and Dieter Rautenbach},
journal= {arXiv preprint arXiv:1406.2438},
year = {2014}
}
Comments
10 pages