Nowhere-zero 3-flows in matroid base graph
From MaRDI portal
Publication:1945586
DOI10.1007/s11464-012-0246-xzbMath1261.05039OpenAlexW2083724903MaRDI QIDQ1945586
Publication date: 8 April 2013
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-012-0246-x
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Paths in circuit graphs of matroids
- Nowhere-zero 3-flows in triangularly connected graphs
- A lower bound on connectivities of matroid base graphs
- Flows and generalized coloring theorems in graphs
- On Tutte's extension of the four-colour problem
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- Nowhere-zero 3-flows in abelian Cayley graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- Nowhere‐zero 3‐flows in products of graphs
- On the algebraic theory of graph colorings
- A Contribution to the Theory of Chromatic Polynomials