On induced colourful paths in triangle-free graphs

DOI10.1016/j.endm.2017.06.022zbMath1378.05043arXiv1604.06070OpenAlexW2962796428WikidataQ129253286 ScholiaQ129253286MaRDI QIDQ5915804

L. Sunil Chandran, Jasine Babu, Manu Basavaraju, Mathew C. Francis

Publication date: 18 January 2018

Published in: Discrete Applied Mathematics, Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphinduced pathcolourful path

Mathematics Subject Classification ID

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

Related Items (4)

Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths ⋮ Induced colorful trees and paths in large chromatic 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
• Induced colorful trees and paths in large chromatic graphs
• Rainbow paths with prescribed ends
• Induced subtrees in graphs of large chromatic number
• Colorful induced subgraphs
• Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
• On induced colourful paths in triangle-free graphs
• A generalization of the Gallai-Roy theorem

This page was built for publication: On induced colourful paths in triangle-free graphs