Worm colorings

DOI10.7151/DMGT.1814MaRDI QIDQ2516682zbMATH OpenOpenAlexFDO

Authors Kirsti Wash, Honghai Xu, Wayne Goddard

Publication date 4 August 2015

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

coloringforbiddenmonochromaticpathrainbow

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• WORM colorings of planar graphs
• The color cost of a caterpillar
• Percolation of worms
• Brownian earthworm
• WORM colorings forbidding cycles or cliques
• Coloring chains
• Differential gorms and worms

Cites work

• 3-consecutive C-colorings of graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Bipartite anti-Ramsey numbers of cycles
• Edge-colorings avoiding rainbow and monochromatic subgraphs
• Graph colorings with local constraints -- a survey
• scientific article; zbMATH DE number 517057 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Interior graphs of maximal outerplane graphs
• Vertex coloring without large polychromatic stars
• WORM colorings forbidding cycles or cliques

Cited in

(17)

• Improved bounds for some facially constrained colorings
• Singular Turán numbers and worm-colorings
• Chromatic spectrum of \(K_s\)-WORM colorings of \(K_n\)
• Facially-constrained colorings of plane graphs: a survey
• \(F\)-WORM colorings: results for 2-connected graphs
• Coloring subgraphs with restricted amounts of hues
• Vertex colorings without rainbow subgraphs
• 3-sequent achromatic sum of graphs
• Mixed hypergraphs and beyond
• WORM colorings of planar graphs
• ℱ-WORM colorings of some 2-trees: partition vectors
• WORM colorings forbidding cycles or cliques
• scientific article; zbMATH DE number 7589550 (Why is no real title available?)
• Homogeneous colourings of graphs
• Vertex neighborhood restricted edge achromatic sums of graphs
• Bounds on coloring trees without rainbow paths
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

This page was built for publication: Worm colorings

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