Change search
ReferencesLink to record
Permanent link

Direct link
Cycle double covers containing certain circuits in cubic graphs having special structures
Institute for Information Systems, Technical University of Vienna, Wien, Austria.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2015 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 338, no 10, 1750-1754 p.Article in journal (Refereed) Published
Abstract [en]

Our point of departure is Fleischner and Haggkvist (2014, Theorem 2). We first generalize this theorem. Then we apply it to cubic graphs whose vertex set can be decomposed into two classes, one class inducing a circuit and the other class inducing a (subdivision of a) caterpillar. (C) 2014 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
Elsevier, 2015. Vol. 338, no 10, 1750-1754 p.
Keyword [en]
Circuit double covers, Cycle double covers, Cubic graphs
National Category
URN: urn:nbn:se:umu:diva-106761DOI: 10.1016/j.disc.2014.11.021ISI: 000358092000013OAI: diva2:847450
Available from: 2015-08-20 Created: 2015-08-07 Last updated: 2015-08-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Häggkvist, Roland
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
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: 74 hits
ReferencesLink to record
Permanent link

Direct link