Covering Multigraphs by Simple Circuits
- 1 July 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 6 (3) , 345-350
- https://doi.org/10.1137/0606035
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Shortest coverings of graphs with cyclesJournal of Combinatorial Theory, Series B, 1983
- Integer flowsJournal of Graph Theory, 1983
- Covering Graphs by Simple CircuitsSIAM Journal on Computing, 1981
- Nowhere-zero 6-flowsJournal of Combinatorial Theory, Series B, 1981
- Flows and generalized coloring theorems in graphsJournal of Combinatorial Theory, Series B, 1979
- On the eulericity of a graphJournal of Graph Theory, 1978
- A Contribution to the Theory of Chromatic PolynomialsCanadian Journal of Mathematics, 1954