Coloring graph products---a survey

From MaRDI portal
Publication:1923489

DOI10.1016/0012-365X(94)00377-UzbMath0857.05035OpenAlexW2032331898WikidataQ64356951 ScholiaQ64356951MaRDI QIDQ1923489

Sandi Klavžar

Publication date: 12 November 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00377-u




Related Items

Thinness of product graphsDominator and total dominator coloring of circulant graph Cn(1, 2)Some properties on the lexicographic product of graphs obtained by monogenic semigroupsOn the Hadwiger's conjecture for graph productsOn the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric GraphsGraph \(r\)-hued colorings -- a surveyThe independence number of the strong product of cyclesChromatic vertex Folkman numbersPartially concurrent open shop scheduling with integral preemptionsDominated coloring in product graphsRelatively small counterexamples to Hedetniemi's conjectureUnnamed ItemBounded colouring motivated by the limited resource partially concurrent open shop problemOn robust colorings of Hamming-distance graphsCounterexamples to Hedetniemi's conjectureA note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl functionColoring the Cartesian sum of graphsFuzzy chromatic number of union of fuzzy graphs: an algorithm, properties and its applicationThe antistrong property for special digraph familiesSOME PROPERTIES ON THE DISJUNCTIVE PRODUCT OVER GRAPHS OF MONOGENIC SEMIGROUPSON THE CORONA PRODUCT OF MONOGENIC SEMIGROUP GRAPHSON FUZZY CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME FUZZY GRAPHS AND ITS APPLICATIONNote on Hedetniemi's conjecture and the Poljak-Rödl functionUnnamed ItemThe thickness of the Kronecker product of graphsA note on the Poljak-Rödl functionOn the fractional chromatic number and the lexicographic product of graphsGame chromatic number of strong product graphsColoring the Cartesian Sum of Graphs



Cites Work