Induced colorful trees and paths in large chromatic graphs
From MaRDI portal
Publication:504985
zbMATH Open1353.05049MaRDI QIDQ504985FDOQ504985
Authors: 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- Title not available (Why is that?)
- Coloring graphs with locally few colors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Induced subtrees in graphs of large chromatic number
- Title not available (Why is that?)
- Colorful induced subgraphs
- χ‐bounded families of oriented graphs
- Colorful paths for 3-chromatic graphs
- On induced colourful paths in triangle-free graphs
Cited In (6)
- 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
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
- On induced colourful paths in triangle-free graphs
- Structure and colour in triangle-free graphs
This page was built for publication: Induced colorful trees and paths in large chromatic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504985)