Largest 2-Regular Subgraphs in 3-Regular Graphs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 236
  • Download : 0
For a graph G, let f2(G) denote the largest number of vertices in a 2-regular subgraph of G. We determine the minimum of f2(G) over 3-regular n-vertex simple graphs G. To do this, we prove that every 3-regular multigraph with exactly c cut-edges has a 2-regular subgraph that omits at most max{0,(c-1)/2} vertices. More generally, every n-vertex multigraph with maximum degree 3 and m edges has a 2-regular subgraph that omits at most max{0,(3n-2m+c-1)/2} vertices. These bounds are sharp; we describe the extremal multigraphs.
Publisher
SPRINGER JAPAN KK
Issue Date
2019-07
Language
English
Article Type
Article
Citation

GRAPHS AND COMBINATORICS, v.35, no.4, pp.805 - 813

ISSN
0911-0119
DOI
10.1007/s00373-019-02021-6
URI
http://hdl.handle.net/10203/263016
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0