Chromatic Number of Cartesian Sum of Two Graphs

DOI10.2307/2035847zbMath0157.55202OpenAlexW4234158839MaRDI QIDQ5540283

Kung-Wei Yang

Publication date: 1968

Full work available at URL: https://doi.org/10.2307/2035847

zbMATH Keywords

topology

Related Items (7)

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 ⋮ Chromatic number via Turán number ⋮ Coloring the Cartesian sum of graphs ⋮ Numerical invariants and the strong product of graphs ⋮ Coloring the Cartesian Sum of Graphs

This page was built for publication: Chromatic Number of Cartesian Sum of Two Graphs