Induced colorful trees and paths in large chromatic graphs

zbMath1353.05049MaRDI QIDQ504985

András Gyárfás, Gábor N. Sárközy

Publication date: 18 January 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p46

zbMATH Keywords

induced subgraphsgraph colorings

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths, Template-driven rainbow coloring of proper interval graphs, Template-driven rainbow coloring of proper interval graphs, On induced colourful paths in triangle-free graphs, Structure and colour in triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colorful paths for 3-chromatic graphs
• Coloring graphs with locally few colors
• Induced subtrees in graphs of large chromatic number
• Colorful induced subgraphs
• χ‐bounded families of oriented graphs
• On induced colourful paths in triangle-free graphs