Premium
Cycle covers of graphs with a nowhere‐zero 4‐flow
Author(s) -
Raspaud André
Publication year - 1991
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.3190150608
Subject(s) - mathematics , combinatorics , conjecture , zero (linguistics) , simple graph , graph , simple (philosophy) , flow (mathematics) , discrete mathematics , geometry , philosophy , linguistics , epistemology
It is shown that the edges of a simple graph with a nowhere‐zero 4‐flow can be covered with cycles such that the sum of the lengths of the cycles is at most | E ( G )| + | V ( G )| −3. This solves a conjecture proposed by G. Fan.
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