On chromatic number of products of two graphs

DOI10.4064/cm-25-1-49-52zbMath0239.05114OpenAlexW972873952MaRDI QIDQ5650700

Mieczysław Borowiecki

Publication date: 1972

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/cm-25-1-49-52

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ On the chromatic number of the lexicographic product and the Cartesian sum of graphs ⋮ Coloring graph products---a survey ⋮ Coloring the Cartesian sum of graphs ⋮ Coloring the Cartesian Sum of Graphs

This page was built for publication: On chromatic number of products of two graphs