A note on orientation and chromatic number of graphs
From MaRDI portal
Publication:2410109
DOI10.1007/s10878-016-0094-9zbMath1390.05078OpenAlexW2553620626MaRDI QIDQ2410109
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0094-9
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Generating all the acyclic orientations of an undirected graph
- Decomposing a planar graph of girth 5 into an independent set and a forest
- Colorings and orientations of graphs
- Acyclic orientations of a graph and the chromatic and independence numbers
- Partition the vertices of a graph into one independent set and one acyclic set
- Solutions of irreflexive relations
- Acyclic Orientations with Path Constraints
- New bounds for the chromatic number of graphs
- Nombre chromatique et plus longs chemins d'un graphe