Largest 2-regular subgraphs in 3-regular graphs

DOI10.1007/s00373-019-02021-6zbMath1416.05150arXiv1903.08795OpenAlexW2925142624WikidataQ128028917 ScholiaQ128028917MaRDI QIDQ2000571

Ilkyoo Choi, Ringi Kim, Douglas B. West, Boram Park, Alexandr V. Kostochka

Publication date: 28 June 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.08795

zbMATH Keywords

cubic graphsfactors in graphscut-edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matchings in regular graphs
• Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
• Dynamic cage survey
• Tight lower bounds on the size of a maximum matching in a regular graph
• Cut-edges and regular factors in regular graphs of odd degree
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• The Factorization of Linear Graphs

This page was built for publication: Largest 2-regular subgraphs in 3-regular graphs