Abstract
LetGbe a 2-edge-connected graph withmedges andnvertices. The following two conjectures are proved in this paper. (i)The edges ofGcan be covered by circuits of total length at mostm+n-1. (ii)The vertices ofGcan be covered by circuits of total length at most 2(n-1), wheren≥2. © 1998 Academic Press.
Cite
CITATION STYLE
APA
Fan, G. (1998). Proofs of Two Minimum Circuit Cover Conjectures. Journal of Combinatorial Theory. Series B, 74(2), 353–367. https://doi.org/10.1006/jctb.1998.1854
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free