Acyclic orientations of a graph and the chromatic and independence numbers

DOI10.1016/0095-8956(79)90048-0zbMath0331.05110OpenAlexW2011120948MaRDI QIDQ1227749

K. Appert

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90048-0

zbMATH Keywords

ACYCLIC ORIENTATIONSCHROMATIC NUMBERINDEPENDENCE NUMBERS

Mathematics Subject Classification ID

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

Related Items (6)

Acyclic Orientations with Path Constraints ⋮ A note on orientation and chromatic number of graphs ⋮ Oriented hypergraphs, stability numbers and chromatic numbers ⋮ On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Graph orientation with splits

Cites Work

• A Theorem on n-Coloring the Points of a Linear Graph
• Reducibility among Combinatorial Problems
• Paths, Trees, and Flowers
• Nombre chromatique et plus longs chemins d'un graphe
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Acyclic orientations of a graph and the chromatic and independence numbers