The 7/5‐conjecture strengthens itself

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)65-67
Number of pages3
JournalJournal of Graph Theory
Volume19
Issue number1
DOIs
StatePublished - Jan 1995
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint

Dive into the research topics of 'The 7/5‐conjecture strengthens itself'. Together they form a unique fingerprint.

Cite this