Independent domination, colorings and the fractional idomatic number of a graph
From MaRDI portal
Publication:2185446
DOI10.1016/j.amc.2020.125340OpenAlexW3022382553MaRDI QIDQ2185446
Michael A. Henning, Wayne Goddard
Publication date: 4 June 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125340
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Partial domination and irredundance numbers in graphs ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Independent domination in outerplanar graphs
Cites Work
- On \(r\)-dynamic coloring of graphs
- On domination and independent domination numbers of a graph
- Two relations between the parameters of independence and irredundance
- Disjoint independent dominating sets in graphs
- Coverings by minimal transversals
- On well-covered triangulations. I
- Dominating sets in planar graphs
- Independent domination in graphs: A survey and recent results
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- On independent domination in planar cubic graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Deploying Robots With Two Sensors inK1, 6-Free Graphs
- Thoroughly dispersed colorings
- Acyclic total dominating sets in cubic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent domination, colorings and the fractional idomatic number of a graph