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

DOI10.1016/j.ejc.2011.07.002zbMath1284.05204WikidataQ123117540 ScholiaQ123117540MaRDI QIDQ648993

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

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

05C76: Graph operations (line graphs, products, etc.)

Related Items

The total co-independent domination number of some graph operations, The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products, Independence number of generalized products of graphs, Strong resolving partitions for strong product graphs and Cartesian 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, On 3-colorings of direct products of graphs, On the \(k\)-independence number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Independent sets in direct products of vertex-transitive graphs
• Homomorphisms of 3-chromatic graphs
• The chromatic number of the product of two 4-chromatic graphs is 4
• A survey on Hedetniemi's conjecture
• Graph products and the chromatic difference sequence of vertex-transitive graphs
• Primitivity and independent sets in direct products of vertex-transitive graphs
• Projectivity and independent sets in powers of graphs