Worm colorings

DOI10.7151/dmgt.1814zbMath1317.05055OpenAlexW4236906586MaRDI QIDQ2516682

Honghai Xu, Kirsti Wash, Wayne Goddard

Publication date: 4 August 2015

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

Full work available at URL: https://doi.org/10.7151/dmgt.1814

zbMATH Keywords

rainbowpathcoloringforbiddenmonochromatic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Vertex colorings without rainbow subgraphs ⋮ Singular Turán numbers and worm-colorings ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ Coloring subgraphs with restricted amounts of hues ⋮ Vertex neighborhood restricted edge achromatic sums of graphs ⋮ Unnamed Item ⋮ WORM colorings of planar graphs ⋮ Mixed hypergraphs and beyond ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ 3-Sequent achromatic sum of graphs ⋮ Improved bounds for some facially constrained colorings ⋮ Homogeneous colourings of graphs

Cites Work

• Vertex coloring without large polychromatic stars
• Edge-colorings avoiding rainbow and monochromatic subgraphs
• Interior graphs of maximal outerplane graphs
• 3-consecutive C-colorings of graphs
• Bipartite anti-Ramsey numbers of cycles
• Graph colorings with local constraints -- a survey
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item