Convex circuit-free coloration of an oriented graph

DOI10.1016/J.EJC.2008.02.012MaRDI QIDQ2519795zbMATH OpenOpenAlexFDO

Authors Jean-François Culus, Bertrand Jouve

Publication date 27 January 2009

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

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

zbMATH Keywords

convex circuit-free chromatic numberoptimal convex circuit-free coloration for tournaments

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• SOFSEM 2006: Theory and Practice of Computer Science
• Oriented coloring on recursively defined digraphs
• Consecutive colouring of oriented graphs
• Injective oriented colourings
• Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs

Cites work

• \(P_ 4\)-trees and substitution decomposition
• Acyclic Homomorphisms and Circular Colorings of Digraphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• scientific article; zbMATH DE number 3687449 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• Indecomposable graphs
• Primitivity is hereditary for 2-structures
• The chromatic number of oriented graphs
• Transitiv orientierbare Graphen
• Transitive convex subsets in large tournaments
• Vertex critical r-dichromatic tournaments

Cited in

(4)

• Consecutive colouring of oriented graphs
• Critically twin primitive 2-structures
• The critically duo-free infinite tournaments
• Inversions in tournaments

This page was built for publication: Convex circuit-free coloration of an oriented graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519795)