Projectivity and independent sets in powers of graphs
From MaRDI portal
Publication:3150193
DOI10.1002/JGT.10041zbMath1003.05077OpenAlexW4253190912MaRDI QIDQ3150193
Publication date: 14 January 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10041
Cites Work
- The complete intersection theorem for systems of finite sets
- Homomorphisms of 3-chromatic graphs
- The intersection theorem for direct products
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A note on the star chromatic number
- On the chromatic number of the product of graphs
- Star chromatic numbers and products of graphs
- Applications of product colouring
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Hedetniemi's conjecture and the retracts of a product of graphs
Related Items (13)
Structure of independent sets in direct products of some vertex-transitive graphs ⋮ In praise of homomorphisms ⋮ Maximum independent sets in direct products of cycles or trees with arbitrary graphs ⋮ Independent sets in direct products of vertex-transitive graphs ⋮ Intersecting Families in Symmetric Unions of Direct Products of Set Families ⋮ The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture ⋮ On 3-colorings of direct products of graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Independent sets in tensor products of three vertex-transitive graphs ⋮ Primitivity and independent sets in direct products of vertex-transitive graphs ⋮ Independence and coloring properties of direct products of some vertex-transitive graphs ⋮ Independent sets of maximal size in tensor powers of vertex-transitive graphs ⋮ Stable sets of maximal size in Kneser-type graphs
This page was built for publication: Projectivity and independent sets in powers of graphs
