Circuit coverings of graphs and a conjecture of Pyber

DOI10.1006/JCTB.1995.1040zbMath0831.05052OpenAlexW2087082869MaRDI QIDQ1898727

Geng-Hua Fan

Publication date: 20 September 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1040

zbMATH Keywords

bridgeless graphinteger flowcircuit coverconjecture by Pyber

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Extensions of flow theorems ⋮ Covering a graph by complete bipartite graphs

This page was built for publication: Circuit coverings of graphs and a conjecture of Pyber