Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths

zbMath1366.05047arXiv1702.01094MaRDI QIDQ2363116

Alexander D. Scott, P. D. Seymour

Publication date: 13 July 2017

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

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

zbMATH Keywords

rainbowcolouring

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 (5)

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 ⋮ Pure pairs. II: Excluding all subdivisions of a graph

Cites Work

• Induced colorful trees and paths in large chromatic graphs
• A Ramsey-type theorem for traceable graphs
• Colorful induced subgraphs
• Induced subgraphs of graphs with large chromatic number. XI. Orientations
• Nombre chromatique et plus longs chemins d'un graphe
• On induced colourful paths in triangle-free graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths