Chromatic coloring with a maximum color class

DOI10.1016/J.DISC.2007.10.019zbMATH Open1159.05310OpenAlexW2130311971MaRDI QIDQ998433FDOQ998433

Authors: Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen 

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.019

Recommendations

• scientific article; zbMATH DE number 554167
• On the Strong Chromatic Number of Graphs
• On the maximum number of colorings of a graph
• The chromatic index of graphs of even order with many edges
• Colouring a graph frugally

zbMATH Keywords

chromatic numbermaximum degreeindependence numbervertex coloringchromatic coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Equitable \(\Delta\)-coloring of graphs
• Title not available (Why is that?)
• On bounding the difference between the maximum degree and the chromatic number by a constant
• Decomposition of realizable fuzzy relations
• Equivalence of two conjectures on equitable coloring of graphs

This page was built for publication: Chromatic coloring with a maximum color class

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