Independent domatic partitioning or fall coloring of strongly chordal graphs

MaRDI QIDQ3378230zbMATH OpenFDO

Authors Jeremy Lyle, Nate Drake, Renu C. Laskar

Publication date 30 March 2006

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
• On graph fall-coloring: existence and constructions
• scientific article; zbMATH DE number 1506511
• The domatic number problem on some perfect graph families
• Fall coloring of graphs. I

Cited in

(7)

• Fall colouring of bipartite graphs and Cartesian products of graphs
• On the number of maximal independent sets in minimum colorings of split graphs
• Graphs with small fall-spectrum
• On graph fall-coloring: existence and constructions
• On idomatic partitions of direct products of complete graphs
• \(b\)-coloring parameterized by clique-width
• b-coloring parameterized by clique-width

This page was built for publication: Independent domatic partitioning or fall coloring of strongly chordal graphs

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