Bound on Shortest Cycle Covers
- 12 December 2025
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 45 (6) , 66
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- On Fan’s Conjecture About 4-FlowGraphs and Combinatorics, 2024
- Note on Integer 4-flows in GraphsActa Mathematica Sinica, English Series, 2022
- Integer 4-Flows and Cycle CoversCombinatorica, 2016
- Graph Theory2008
- The Moore Bound for Irregular GraphsGraphs and Combinatorics, 2002
- Fulkerson′s Conjecture and Circuit CoversJournal of Combinatorial Theory, Series B, 1994
- Short circuit covers for regular matroids with a nowhere zero 5-flowJournal of Combinatorial Theory, Series B, 1987
- Shortest coverings of graphs with cyclesJournal of Combinatorial Theory, Series B, 1983
- Flows and generalized coloring theorems in graphsJournal of Combinatorial Theory, Series B, 1979
- Eine gemeinsame Basis f r die Theorie der Eulerschen Graphen und den Satz von PetersenMonatshefte für Mathematik, 1976