On idomatic partitions of direct products of complete graphs

DOI10.1007/S00373-010-0997-7MaRDI QIDQ659730zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, Gašper Mekiš

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

dominating setindependent setcomplete graphindependent dominating setdirect product of graphidomatic partition

Mathematics Subject Classification ID

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

Recommendations

• Idomatic partitions of direct products of complete graphs
• Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs
• On independent domination in direct products
• scientific article; zbMATH DE number 6311742
• Smallest independent dominating sets in Kronecker products of cycles

Cites work

• scientific article; zbMATH DE number 1506511 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• A survey on Hedetniemi's conjecture
• Disjoint independent dominating sets in graphs
• Factoring cardinal product graphs in polynomial time
• Hedetniemi's conjecture---a survey
• Idomatic partitions of direct products of complete graphs
• Independence and coloring properties of direct products of some vertex-transitive graphs
• Independent domatic partitioning or fall coloring of strongly chordal graphs
• Isomorphic components of Kronecker product of bipartite graphs
• On Cartesian skeletons of graphs
• On acyclic colorings of direct produts
• On direct product cancellation of graphs
• On the cancellation law among finite relational structures
• Proof of a conjecture concerning the direct product of bipartite graphs
• The Kronecker Product of Graphs
• The chromatic number of the product of two 4-chromatic graphs is 4

Cited in

(7)

• On independent domination in direct products
• A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product
• Injective coloring of graphs revisited
• Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs
• Idomatic partitions of direct products of complete graphs
• On the number of maximal independent sets in minimum colorings of split graphs
• On graph fall-coloring: existence and constructions

This page was built for publication: On idomatic partitions of direct products of complete graphs

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