Forbidden subgraph colorings and the oriented chromatic number

DOI10.1016/J.EJC.2011.09.045MaRDI QIDQ1933644zbMATH OpenOpenAlexFDO

Authors N. R. Aravind, C. R. Subramanian

Publication date 24 January 2013

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

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

zbMATH Keywords

subgraph chromatic numbertreewidth chromatic numberLovász local lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Forbidden subgraph colorings and the oriented chromatic number
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• scientific article; zbMATH DE number 2159660
• Improved bounds on coloring of graphs

Cited in

(3)

• Bounds on vertex colorings with restrictions on the union of color classes
• Intersection dimension and graph invariants
• Forbidden subgraph colorings and the oriented chromatic number

This page was built for publication: Forbidden subgraph colorings and the oriented chromatic number

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