Shortest circuit covers of cubic graphs
type: Item
instance of: scholarly article
title: Shortest circuit covers of cubic graphs
zbMATH Open document ID: 0805.05065
author: Bill Jackson
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-01-26T00:00:00Z
review text: The paper provides a constructive proof that the edge set of a bridgeless cubic graph \(G\) can be covered by circuits with lengths summing to at most \({64 \over 39} | E(G) |\). The proof technique indicates a polynomial algorithm for finding such a circuit cover. Improvements for cubic graphs of larger girth are included.
reviewed by: R. E. L. Aldred
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 562411
zbMATH Keywords: cycles covers
zbMATH Keywords: cubic graph
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: circuit cover
MaRDI profile type: Publication
full work available at URL: jctb.1994.1021
OpenAlex ID: W1977200224
DOI: 10.1006/JCTB.1994.1021
description: scientific article; zbMATH DE number 562411