Independent domination and graph colorings
From MaRDI portal
Publication:3615811
Recommendations
Cited in
(20)- On the dominated chromatic number of certain graphs
- Some extremal results on the chromatic stability index
- scientific article; zbMATH DE number 5621287 (Why is no real title available?)
- Relations between the lower domination parameters and the chromatic number of a graph.
- A note on dom-color number of a graph
- Dominating coloring number of claw-free graphs
- On the chromatic vertex stability number of graphs
- Maximal independent sets in minimum colorings
- On the chromatic edge stability number of graphs
- Coloring and domination in graphs
- On critical graphs for the chromatic edge-stability number
- New parameters involving chromatic sum in a graph
- Independence number and packing coloring of generalized Mycielski graphs
- On the \(\rho \)-edge stability number of graphs
- From domination to coloring. Stephen Hedetniemi's graph theory and beyond
- On the number of maximal independent sets in minimum colorings of split graphs
- A Gallai’s Theorem type result for the edge stability of graphs
- Relations between the domination parameters and the chromatic index of a graph
- \(\gamma\)-chromatic partition in planar graph characterization
- Parameters of independence and domination by monochromatic paths in graphs
This page was built for publication: Independent domination and graph colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615811)
