Premium
The 7/5‐conjecture strengthens itself
Author(s) -
Kostochka A. V.
Publication year - 1995
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.3190190107
Subject(s) - conjecture , combinatorics , mathematics , graph , cover (algebra) , cubic graph , enhanced data rates for gsm evolution , graph minor , discrete mathematics , graph power , computer science , line graph , voltage graph , artificial intelligence , mechanical engineering , engineering
The following is proved: if every bridgeless graph G has a cycle cover of length at most 7/5| E ( G )|, then every bridgeless graph G has a cycle cover of length at most 7/5| E ( G )| such that any edge of G is covered once or twice. © 1995 John Wiley & Sons, Inc.
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