On 3-colorings of direct products of graphs

DOI10.7151/dmgt.2085zbMath1404.05060OpenAlexW2799298301MaRDI QIDQ1717192

Simon Špacapan

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2085

zbMATH Keywords

independence numberdirect productHedetniemi's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Structure of independent sets in direct products of some vertex-transitive graphs
• Independent sets in direct products of vertex-transitive graphs
• Hedetniemi's conjecture and dense Boolean lattices
• The fractional version of Hedetniemi's conjecture is true
• The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture
• On the ultimate categorical independence ratio
• The chromatic number of the product of two 4-chromatic graphs is 4
• A survey on Hedetniemi's conjecture
• Graph products, Fourier analysis and spectral techniques
• Independence and coloring properties of direct products of some vertex-transitive graphs
• Primitivity and independent sets in direct products of vertex-transitive graphs
• Projectivity and independent sets in powers of graphs
• Applications of product colouring

This page was built for publication: On 3-colorings of direct products of graphs