Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties
Authors:
- François JaegerFJFrançois Jaeger
- Nathan LinialNLNathan Linial
- Charles PayanCPCharles Payan
- Michael TarsiMTMichael Tarsi
- 1 November 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 56 (2) , 165-182
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Additive bases of vector spaces over prime fieldsJournal of Combinatorial Theory, Series A, 1991
- Cycle covering of binary matroidsJournal of Combinatorial Theory, Series B, 1989
- Short circuit covers for regular matroids with a nowhere zero 5-flowJournal of Combinatorial Theory, Series B, 1987
- Nowhere zero flow and circuit covering in regular matroidsJournal of Combinatorial Theory, Series B, 1985
- Nowhere-zero 6-flowsJournal of Combinatorial Theory, Series B, 1981
- Flows and generalized coloring theorems in graphsJournal of Combinatorial Theory, Series B, 1979
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961
- A Contribution to the Theory of Chromatic PolynomialsCanadian Journal of Mathematics, 1954