Induced subgraphs of graphs with large chromatic number. XI. Orientations

DOI10.1016/J.EJC.2018.09.003zbMath1402.05062arXiv1711.07679OpenAlexW2963684155WikidataQ129125269 ScholiaQ129125269MaRDI QIDQ1633601

Maria Chudnovsky, P. D. Seymour, Alexander D. Scott

Publication date: 20 December 2018

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

Full work available at URL: https://arxiv.org/abs/1711.07679

zbMATH Keywords

hypergraphschromatic numbertreesclique numbercoloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths ⋮ Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Heroes in Orientations of Chordal Graphs ⋮ A note on chromatic number and induced odd cycles ⋮ On coloring digraphs with forbidden induced subgraphs ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Heroes in oriented complete multipartite graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Conflict-free coloring of string graphs ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes ⋮ Pure pairs. II: Excluding all subdivisions of a graph ⋮ Restricted frame graphs and a conjecture of Scott

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
• Induced subtrees in graphs of large chromatic number
• Colorful induced subgraphs
• Applications of hypergraph coloring to coloring graphs not inducing certain trees
• Graph Theory and Probability
• Radius two trees specify χ‐bounded classes
• χ‐bounded families of oriented graphs
• Radius Three Trees in Graphs with Large Chromatic Number

This page was built for publication: Induced subgraphs of graphs with large chromatic number. XI. Orientations