Neighborhood-restricted [ 2]-achromatic colorings

DOI10.1016/J.DAM.2016.02.023MaRDI QIDQ290097zbMATH OpenOpenAlexFDO

Authors Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi, James D. Chandler

Publication date 1 June 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.02.023

zbMATH Keywords

\([\leq 2\)-achromatic number]\([\leq k\)-achromatic number]chromatic numberneighborhood-restricted colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Neighborhood-rainbow colorings of graphs
• Vertex neighborhood restricted edge achromatic sums of graphs
• scientific article; zbMATH DE number 6468154
• scientific article; zbMATH DE number 1885944
• The achromatic number of Kneser graphs

Cites work

• 3-consecutive C-colorings of graphs
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• Neighborhood-restricted \([\leq 2]\)-achromatic colorings
• Vertex coloring without large polychromatic stars
• Vertex colorings without rainbow subgraphs

Cited in

(7)

• Open neighborhood chromatic number of an antiprism graph
• Neighborhood-restricted \([\leq 2]\)-achromatic colorings
• A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs
• Vertex neighborhood restricted edge achromatic sums of graphs
• Tight bounds for the N₂-chromatic number of graphs
• Bounds on coloring trees without rainbow paths
• Finding maximum weight 2-packing sets on arbitrary graphs

This page was built for publication: Neighborhood-restricted \([\leq 2]\)-achromatic colorings

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