Antisymmetric flows and strong colourings of oriented graphs

DOI10.5802/aif.1705zbMath0921.05034WikidataQ105856728 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

zbMATH Keywords

flows; digraphs; abelian group; colorings

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

Related Items

Antisymmetric flows on planar graphs, Antisymmetric flows in matroids, Antisymmetric flows and strong oriented coloring of planar graphs, Antisymmetric flows and edge-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A Class Of Abelian Groups
• Every planar map is four colorable
• On-Line Coloring and Recursive Graph Theory
• A Contribution to the Theory of Chromatic Polynomials
• Acyclic colorings of planar graphs