Maximum independent sets in direct products of cycles or trees with arbitrary graphs

DOI10.7151/dmgt.1837zbMath1327.05265MaRDI QIDQ891314

Tjaša Paj, Simon Špacapan

Publication date: 17 November 2015

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

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

zbMATH Keywords

independent setdirect product

Mathematics Subject Classification ID

05C38: Paths and cycles

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Uses Software

• NISPOC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The fractional version of Hedetniemi's conjecture is true
• The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture
• A survey on Hedetniemi's conjecture
• Graph products and the chromatic difference sequence of vertex-transitive graphs
• On the independence number of the strong product of cycle-powers
• 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
• Notes on the independence number in the Cartesian product of graphs
• Applications of product colouring