Antisymmetric flows and strong colourings of oriented graphs
From MaRDI portal
Publication:1296157
DOI10.5802/aif.1705zbMath0921.05034OpenAlexW2061830033WikidataQ105856728 ScholiaQ105856728MaRDI QIDQ1296157
Jaroslav Nešetřil, Andre Raspaud
Publication date: 12 July 1999
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIF_1999__49_3_1037_0
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (15)
Oriented colorings of triangle-free planar graphs ⋮ Oriented colorings of 2-outerplanar graphs ⋮ Antisymmetric flows in matroids ⋮ Tutte polynomials for regular oriented matroids ⋮ Strong oriented chromatic number of planar graphs without cycles of specific lengths ⋮ Additive bases and flows in graphs ⋮ Additive Bases and Flows in Graphs ⋮ Antisymmetric flows and strong oriented coloring of planar graphs ⋮ Antisymmetric flows and edge-connectivity ⋮ On the oriented chromatic number of grids ⋮ Circular Flows in Planar Graphs ⋮ An oriented coloring of planar graphs with girth at least five ⋮ Antisymmetric flows on planar graphs ⋮ A note on antisymmetric flows in graphs ⋮ Complexity dichotomy for oriented homomorphism of planar graphs with large girth
Cites Work
- Nowhere-zero integral flows on a bidirected graph
- Nowhere-zero integral chains and flows in bidirected graphs
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Eulerian graphs and related topics. Part 1, Volume 2
- On acyclic colorings of planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- On the maximum average degree and the oriented chromatic number of a graph
- Good and semi-strong colorings of oriented planar graphs
- Colorings and girth of oriented planar graphs
- Flows, view obstructions, and the lonely runner
- On universal graphs for planar oriented graphs of a given girth
- Colored homomorphisms of colored mixed graphs
- Acyclic and oriented chromatic numbers of graphs
- A Class Of Abelian Groups
- Every planar map is four colorable
- On-Line Coloring and Recursive Graph Theory
- The chromatic number of oriented graphs
- A Contribution to the Theory of Chromatic Polynomials
- Acyclic colorings of planar graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Antisymmetric flows and strong colourings of oriented graphs
