On the chromatic number of the lexicographic product and the Cartesian sum of graphs

DOI10.1016/0012-365X(93)E0056-AzbMath0815.05030OpenAlexW2043643906MaRDI QIDQ1339858

Niko Čižek, Sandi Klavžar

Publication date: 11 June 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0056-a

zbMATH Keywords

cycleschromatic numberlexicographic productCartesian sum

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ On the local antimagic chromatic number of the lexicographic product of graphs ⋮ Some properties on the lexicographic product of graphs obtained by monogenic semigroups ⋮ Coloring graph products---a survey ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ Gromov hyperbolicity in the Cartesian sum of graphs ⋮ On the strong metric dimension of the strong products of graphs ⋮ Coloring the Cartesian sum of graphs ⋮ Strong resolving partitions for strong product graphs and Cartesian product graphs ⋮ \([r,s,t\)-colorings of graph products] ⋮ Modular decomposition of graphs and the distance preserving property ⋮ Coloring the Cartesian Sum of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the prime factors of strong direct product graphs in polynomial time
• Two remarks on retracts of graph products
• n-tuple colorings and associated graphs
• Strong products of Kneser graphs
• Strong products of \(\chi\)-critical graphs
• The chromatic number and other functions of the lexicographic product
• Analogues of the Shannon Capacity of a Graph
• Chromatic Number of Cartesian Sum of Two Graphs
• On chromatic number of products of two graphs

This page was built for publication: On the chromatic number of the lexicographic product and the Cartesian sum of graphs