On idomatic partitions of direct products of complete graphs
DOI10.1007/S00373-010-0997-7zbMATH Open1234.05177OpenAlexW2035040347MaRDI QIDQ659730FDOQ659730
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
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
dominating setindependent setcomplete graphindependent dominating setdirect product of graphidomatic partition
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)
Cites Work
- Title not available (Why is that?)
- 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
- The Kronecker Product of Graphs
- On Cartesian skeletons of graphs
- The chromatic number of the product of two 4-chromatic graphs is 4
- Hedetniemi's conjecture---a survey
- Isomorphic components of Kronecker product of bipartite graphs
- Disjoint independent dominating sets in graphs
- 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
- Independent domatic partitioning or fall coloring of strongly chordal graphs
- On acyclic colorings of direct produts
- Title not available (Why is that?)
- Idomatic partitions of direct products of complete graphs
Cited In (6)
- On the number of maximal independent sets in minimum colorings of split graphs
- On graph fall-coloring: existence and constructions
- Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs
- A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product
- On independent domination in direct products
- Injective coloring of graphs revisited
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)
