Proofs of two minimum circuit cover conjectures
type: Item
instance of: scholarly article
title: Proofs of two minimum circuit cover conjectures
zbMATH Open document ID: 1024.05074
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1464273
zbMATH Keywords: 2-edge-connected graph
author: Genghua Fan
MaRDI profile type: Publication
full work available at URL: jctb.1998.1854
OpenAlex ID: W1968574902
cites work: Covering Multigraphs by Simple Circuits
cites work: Graphs with the Circuit Cover Property
cites work: Shortest coverings of graphs with cycles
cites work: Matching, Euler tours and the Chinese postman
cites work: Covering Graphs by Cycles
cites work: Extensions of flow theorems
cites work: Q4344209
cites work: Cycle covering in bridgeless graphs
cites work: Covering Graphs by Simple Circuits
cites work: Q4166786
cites work: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
cites work: Flows and generalized coloring theorems in graphs
cites work: Nowhere-zero 6-flows
cites work: A Class Of Abelian Groups
DOI: 10.1006/JCTB.1998.1854
Recommended article: Circuit coverings of graphs and a conjecture of Pyber
Recommended article: Fulkerson's conjecture and circuit covers
Recommended article: Minimum Circuit Size, Graph Isomorphism, and Related Problems
Recommended article: Q4784386
Recommended article: Minimum-weight cycle covers and their approximability
Recommended article: Minimum-Weight Cycle Covers and Their Approximability
Recommended article: Q4788070
Recommended article: Minimum $T$-Joins and Signed-Circuit Covering
Recommended article: On the Circuit Cover Problem for Mixed Graphs
description: scientific article; zbMATH DE number 1464273