Nordhaus-Gaddum-type relations of three graph coloring parameters

DOI10.1016/j.dam.2013.08.043zbMath1300.05099arXiv1209.2202OpenAlexW2100307598MaRDI QIDQ741774

Kuo-Ching Huang, Ko-Wei Lih

Publication date: 12 September 2014

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

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

zbMATH Keywords

chromatic numbersquare coloringinjective coloringNordhaus-Gaddum2-proper coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Nordhaus-Gaddum type result for the matching number of a graph ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph ⋮ Further results on 2-distance coloring of graphs

Cites Work

• Injective colorings of graphs with low average degree
• List injective colorings of planar graphs
• Injective colorings of sparse graphs
• Injective colorings of planar graphs with few colors
• A survey of Nordhaus-Gaddum type relations
• A survey on labeling graphs with a condition at distance two
• On Complementary Graphs
• Injective coloring of planar graphs

This page was built for publication: Nordhaus-Gaddum-type relations of three graph coloring parameters