Premium
Short cycle covers of cubic graphs
Author(s) -
Fan Genghua
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180204
Subject(s) - cubic graph , mathematics , combinatorics , conjecture , polyhedral graph , graph , discrete mathematics , pathwidth , line graph , voltage graph
Let G be a bridgeless cubic graph. We prove that the edges of G can be covered by circuits whose total length is at most (44/27) | E(G) |, and if Tutte's 3‐flow Conjecture is true, at most (92/57) | E(G) |.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom