On the number of maximal independent sets in minimum colorings of split graphs
From MaRDI portal
Publication:1671359
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1506511 (Why is no real title available?)
- Bounding the clique-width of \(H\)-free split graphs
- Computing role assignments of split 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 domination and graph colorings
- Maximal independent sets in minimum colorings
- On idomatic partitions of direct products of complete graphs
- Pebbling in Split Graphs
- Topics in Intersection Graph Theory
Cited in
(4)
This page was built for publication: On the number of maximal independent sets in minimum colorings of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671359)