Coloring the Cartesian sum of graphs
From MaRDI portal
Publication:998323
DOI10.1016/J.DISC.2007.11.005zbMATH Open1165.05009OpenAlexW2175192782MaRDI QIDQ998323FDOQ998323
Authors: Daphne Der-Fen Liu, Xuding Zhu 
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
Recommendations
- On sum coloring of graphs
- Coloring sums of extensions of certain graphs
- Sum coloring on certain classes of graphs
- Sum Multicoloring of Graphs
- Sum-defined colorings in graphs
- Generalised colouring sums of graphs
- The coloring of graphs
- TOTAL COLORING OF CERTAIN GRAPHS
- scientific article
- Total Colourings of Graphs
Cites Work
- A survey on Hedetniemi's conjecture
- Title not available (Why is that?)
- The fractional chromatic number of the direct product of graphs
- Title not available (Why is that?)
- Recent developments in circular colouring of graphs
- Star chromatic number
- Star chromatic numbers and products of graphs
- Circular chromatic number: A survey
- The chromatic number of the product of two 4-chromatic graphs is 4
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
- Hedetniemi's conjecture---a survey
- A note on the star chromatic number
- Star Extremal Circulant Graphs
- Star-extremal graphs and the lexicographic product
- Title not available (Why is that?)
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Coloring graph products---a survey
- Chromatic Number of Cartesian Sum of Two Graphs
- On chromatic number of products of two graphs
- Star chromatic numbers of graphs
- Fractional colorings with large denominators
- Title not available (Why is that?)
- The fractional chromatic number of infinite graphs
Cited In (7)
- Bounds on the domination number and the metric dimension of co-normal product of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gromov hyperbolicity in the Cartesian sum of graphs
- Chromatic number via Turán number
- STACS 2004
- On automorphisms and fixing number of co-normal product of graphs
This page was built for publication: Coloring the Cartesian sum of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998323)
