The k-independence number of direct products of graphs and Hedetniemi's conjecture

DOI10.1016/J.EJC.2011.07.002MaRDI QIDQ648993zbMATH OpenOpenAlexWikidataFDO

Authors Simon Špacapan

Publication date 29 November 2011

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2011.07.002

Mathematics Subject Classification ID

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

Recommendations

• The \(k\)-independence number of graph products
• scientific article; zbMATH DE number 1792619
• Independence number of products of Kneser graphs
• scientific article; zbMATH DE number 1109407
• On the \(k\)-independence number of graphs
• On \(k\)-independent sets in special products of graphs
• On the \(k\)-independence number in graphs
• Notes on the independence number in the Cartesian product of graphs
• On total $\{k\}$-domatic number of Cartesian and direct product of graphs
• Independence number of generalized products of graphs

Cites work

• scientific article; zbMATH DE number 1792619 (Why is no real title available?)
• A survey on Hedetniemi's conjecture
• Graph products and the chromatic difference sequence of vertex-transitive graphs
• Homomorphisms of 3-chromatic graphs
• Independence in direct-product graphs
• Independent sets in direct products of vertex-transitive graphs
• Primitivity and independent sets in direct products of vertex-transitive graphs
• Projectivity and independent sets in powers of graphs
• The chromatic number of the product of two 4-chromatic graphs is 4

Cited in

(9)

• The \(k\)-independence number of graph products
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• On the strong metric dimension of Cartesian and direct products of graphs
• On the \(k\)-independence number of graphs
• scientific article; zbMATH DE number 2192179 (Why is no real title available?)
• Maximum independent sets in direct products of cycles or trees with arbitrary graphs
• Independence number of generalized products of graphs
• The total co-independent domination number of some graph operations
• On 3-colorings of direct products of graphs

This page was built for publication: The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648993)