Shortest coverings of graphs with cycles
- 1 December 1983
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 35 (3) , 297-308
- https://doi.org/10.1016/0095-8956(83)90056-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Covering Graphs by Simple CircuitsSIAM Journal on Computing, 1981
- Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeidenJournal of Combinatorial Theory, Series B, 1980
- Flows and generalized coloring theorems in graphsJournal of Combinatorial Theory, Series B, 1979
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von PetersenMonatshefte für Mathematik, 1976
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- On minimal blocksTransactions of the American Mathematical Society, 1968
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965