The fractional chromatic number of the direct product of graphs
From MaRDI portal
Publication:4531390
DOI10.1017/S0017089502010066zbMATH Open0995.05052OpenAlexW2170286231MaRDI QIDQ4531390FDOQ4531390
Authors: Xuding Zhu
Publication date: 9 October 2002
Published in: Glasgow Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0017089502010066
Recommendations
- scientific article; zbMATH DE number 2119454
- The fractional chromatic number of the categorical product of graphs
- Independence and coloring properties of direct products of some vertex-transitive graphs
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers
- On the fractional chromatic number, the chromatic number, and graph products
Cited In (12)
- Proof of a conjecture on fractional Ramsey numbers
- Coloring the Cartesian sum of graphs
- Fractional chromatic numbers of tensor products of three graphs
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- The fractional chromatic number of the categorical product of graphs
- Independent sets in direct products of vertex-transitive graphs
- The fractional version of Hedetniemi's conjecture is true
- The chromatic Ramsey number of odd wheels
- The fractional chromatic number of generalized cones over graphs
- \([r,s,t]\)-colorings of graph products
- Independence and coloring properties of direct products of some vertex-transitive graphs
- On the fractional chromatic number and the lexicographic product of graphs
This page was built for publication: The fractional chromatic number of the direct product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531390)