Bounds on coloring trees without rainbow paths

DOI10.7151/DMGT.2582MaRDI QIDQ6892098zbMATH OpenFDO

Authors Wayne Goddard, Tyler Herrman, Simon J. Hughes

Publication date 1 December 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2582

zbMATH Keywords

coronano-rainbowpathtree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• 3-consecutive C-colorings of graphs
• Avoiding rainbow induced subgraphs in vertex-colorings
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• Maximum number of colors: C-coloring and related problems
• Mixed interval hypergraphs
• Neighborhood-restricted \([\leq 2]\)-achromatic colorings
• Vertex coloring without large polychromatic stars
• Vertex colorings without rainbow or monochromatic subgraphs
• Vertex colorings without rainbow subgraphs
• Worm colorings

This page was built for publication: Bounds on coloring trees without rainbow paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892098)