Change search
ReferencesLink to record
Permanent link

Direct link
Even cycle decompositions of 4-regular graphs and line graphs
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2012 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 312, no 17, 2676-2681 p.Article in journal (Refereed) Published
Abstract [en]

An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K 5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-connected cubic graphs. We conjecture that in this class even cycle decompositions always exists and prove the conjecture for cubic graphs with oddness at most 2. We also discuss even cycle double covers of cubic graphs.

Place, publisher, year, edition, pages
Amsterdam, 2012. Vol. 312, no 17, 2676-2681 p.
Keyword [en]
Cycle decompositions, Cycle double covers, Line graphs
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-57888DOI: 10.1016/j.disc.2011.12.007ISI: 000306873100021OAI: diva2:545480
The 8th French Combinatorial Conference, Orsay, France, jun 28-Jul 02, 2010

Special Issue

Available from: 2012-08-20 Created: 2012-08-20 Last updated: 2016-07-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Markström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Discrete Mathematics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 51 hits
ReferencesLink to record
Permanent link

Direct link