On idomatic partitions of direct products of complete graphs

DOI10.1007/s00373-010-0997-7zbMath1234.05177OpenAlexW2035040347MaRDI QIDQ659730

Gašper Mekiš, Sandi Klavžar

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0997-7

zbMATH Keywords

independent setdominating setindependent dominating setcomplete graphdirect product of graphidomatic partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On the number of maximal independent sets in minimum colorings of split graphs, On independent domination in direct products, Injective coloring of graphs revisited, On graph fall-coloring: existence and constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Idomatic partitions of direct products of complete graphs
• Proof of a conjecture concerning the direct product of bipartite graphs
• On direct product cancellation of graphs
• The chromatic number of the product of two 4-chromatic graphs is 4
• Disjoint independent dominating sets in graphs
• A survey on Hedetniemi's conjecture
• Factoring cardinal product graphs in polynomial time
• Independence and coloring properties of direct products of some vertex-transitive graphs
• On the cancellation law among finite relational structures
• The Kronecker Product of Graphs
• On Cartesian skeletons of graphs
• On acyclic colorings of direct produts
• Isomorphic components of Kronecker product of bipartite graphs
• Hedetniemi's conjecture---a survey