A lower bound on the chromatic number of Mycielski graphs

DOI10.1016/S0012-365X(00)00261-2zbMath0973.05033OpenAlexW1990260800WikidataQ127109605 ScholiaQ127109605MaRDI QIDQ5937920

Paolo Dell'Olmo, Massimiliano Caramia

Publication date: 28 November 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00261-2

zbMATH Keywords

lower bound of chromatic numbermultiprocessor task scheduling problemMycielski graph

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

The first and the second Zagreb indices of the generalized Mycielskian of graphs ⋮ Connectivity of the generalised Mycielskian of digraphs ⋮ \(b\)-chromatic sum of Mycielskian of paths ⋮ Graph classes generated by Mycielskians ⋮ Decomposition of realizable fuzzy relations ⋮ Multicoloring and Mycielski construction ⋮ The general \(\alpha \)-decomposition problem of fuzzy relations ⋮ Solving the minimum-weighted coloring problem ⋮ Several parameters of generalized Mycielskians ⋮ On common neighborhood graphs II ⋮ Unnamed Item ⋮ On atom-bond connectivity index of graphs ⋮ On strict strong coloring of graphs

This page was built for publication: A lower bound on the chromatic number of Mycielski graphs