A flow theory for the dichromatic number

DOI10.1016/j.ejc.2017.06.020zbMath1369.05077OpenAlexW2736950330MaRDI QIDQ2403695

Winfried Hochstättler

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.06.020

zbMATH Keywords

oriented matroidsNeumann-Lara-flows

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)

Related Items (10)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ Cuts in matchings of 3-connected cubic graphs ⋮ The digrundy number of digraphs ⋮ The NL-flow polynomial ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ Four proofs of the directed Brooks' theorem ⋮ The diachromatic number of digraphs ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ The chromatic polynomial of a digraph

Cites Work

• Unnamed Item
• Unnamed Item
• Antisymmetric flows in matroids
• On the chromatic number of an oriented matroid
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• The dichromatic number of a digraph
• Bounds of the number of disjoint spanning trees
• On the vertex-arboricity of planar graphs
• A Note on the Vertex Arboricity of a Graph
• On the algebraic theory of graph colorings
• The Point-Arboricity of Planar Graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: A flow theory for the dichromatic number