On graph fall-coloring: existence and constructions
From MaRDI portal
Publication:2287754
Recommendations
Cites work
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1506511 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Applications of product colouring
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs
- Disjoint independent dominating sets in graphs
- Fall colouring of bipartite graphs and Cartesian products of graphs
- Idomatic partitions of direct products of complete graphs
- Independent domatic partitioning or fall coloring of strongly chordal graphs
- Independent dominating sets in graphs of girth five
- Independent domination in graphs: A survey and recent results
- On domination and independent domination numbers of a graph
- On graph fall-coloring -- operators and heredity
- On idomatic partitions of direct products of complete graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Remarks about disjoint dominating sets
- Some problems on idomatic partitions and b-colorings of direct products of complete graphs
Cited in
(7)- On graph fall-coloring -- operators and heredity
- Independent domatic partitioning or fall coloring of strongly chordal graphs
- Fall coloring of graphs. I
- On independent coalition in graphs and independent coalition graphs
- Complexity of fall coloring for restricted graph classes
- scientific article; zbMATH DE number 1506511 (Why is no real title available?)
- Fall colouring of bipartite graphs and Cartesian products of graphs
This page was built for publication: On graph fall-coloring: existence and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287754)