Coloring the Cartesian sum of graphs
From MaRDI portal
Publication:998323
DOI10.1016/j.disc.2007.11.005zbMath1165.05009OpenAlexW2175192782MaRDI QIDQ998323
Xuding Zhu, Daphne Der-Fen Liu
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.005
Related Items (5)
Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Gromov hyperbolicity in the Cartesian sum of graphs ⋮ Chromatic number via Turán number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The chromatic number of the product of two 4-chromatic graphs is 4
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- A survey on Hedetniemi's conjecture
- Star-extremal graphs and the lexicographic product
- Coloring graph products---a survey
- Star chromatic numbers of graphs
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
- A note on the star chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- The fractional chromatic number of the direct product of graphs
- Star Extremal Circulant Graphs
- Fractional colorings with large denominators
- The fractional chromatic number of infinite graphs
- Chromatic Number of Cartesian Sum of Two Graphs
- On chromatic number of products of two graphs
- Hedetniemi's conjecture---a survey
- Circular chromatic number: A survey
This page was built for publication: Coloring the Cartesian sum of graphs
