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

DOI10.1016/J.EJC.2011.07.002zbMATH Open1284.05204OpenAlexW1976644430WikidataQ123117540 ScholiaQ123117540MaRDI QIDQ648993FDOQ648993

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

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

Mathematics Subject Classification ID

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

Cites Work

• Homomorphisms of 3-chromatic graphs
• A survey on Hedetniemi's conjecture
• Graph products and the chromatic difference sequence of vertex-transitive graphs
• Independence in direct-product graphs
• Primitivity and independent sets in direct products of vertex-transitive graphs
• Projectivity and independent sets in powers of graphs
• Independent sets in direct products of vertex-transitive graphs
• Title not available (Why is that?)
• The chromatic number of the product of two 4-chromatic graphs is 4

Cited In (9)

• 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
• Title not available (Why is that?)
• Maximum independent sets in direct products of cycles or trees with arbitrary graphs
• 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
• 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)