Independence and coloring properties of direct products of some vertex-transitive graphs
From MaRDI portal
Publication:2509308
DOI10.1016/j.disc.2006.04.013zbMath1111.05040OpenAlexW1988180158WikidataQ58051177 ScholiaQ58051177MaRDI QIDQ2509308
Mario Valencia-Pabon, Juan Carlos Vera
Publication date: 19 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.013
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (16)
Structure of independent sets in direct products of some vertex-transitive graphs ⋮ Thinness of product graphs ⋮ On the strong metric dimension of Cartesian and direct products of graphs ⋮ Maximum independent sets in direct products of cycles or trees with arbitrary graphs ⋮ Colorings of complements of line graphs ⋮ Independent sets in direct products of vertex-transitive graphs ⋮ Intersecting Families in Symmetric Unions of Direct Products of Set Families ⋮ On 3-colorings of direct products of graphs ⋮ Independence number of products of Kneser graphs ⋮ On idomatic partitions of direct products of complete graphs ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ Independent sets in tensor products of three vertex-transitive graphs ⋮ Primitivity and independent sets in direct products of vertex-transitive graphs ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ Counterexamples to Hedetniemi's conjecture ⋮ Colouring clique-hypergraphs of circulant graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Homomorphisms of 3-chromatic graphs
- The chromatic number of the product of two 4-chromatic graphs is 4
- n-tuple colorings and associated graphs
- The intersection theorem for direct products
- Choosability of powers of circuits
- Graph products and the chromatic difference sequence of vertex-transitive graphs
- Projectivity and independent sets in powers of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A note on the star chromatic number
- Star chromatic number
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Independence and coloring properties of direct products of some vertex-transitive graphs