Chromatic Number of Cartesian Sum of Two Graphs

DOI10.2307/2035847MaRDI QIDQ5540283zbMATH OpenOpenAlexFDO

Authors Kung-Wei Yang

Publication date 1968

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

zbMATH Keywords

topology

Cited in

(8)

• 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
• Numerical invariants and the strong product of graphs
• Coloring the Cartesian Sum of Graphs
• On automorphisms and fixing number of co-normal product of graphs
• Bounds on the domination number and the metric dimension of co-normal product of graphs
• Coloring the Cartesian sum of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540283)