Improved bounds for the chromatic number of the lexicographic product of graphs

zbMath0814.05037MaRDI QIDQ1345197

Sandi Klavžar, Roland Kaschek

Publication date: 28 February 1995

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundlower boundchromatic numberlexicographic productcomplete core

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Coloring graph products---a survey ⋮ On wreathed lexicographic products of graphs

This page was built for publication: Improved bounds for the chromatic number of the lexicographic product of graphs