The dominated chromatic number of middle graphs
From MaRDI portal
Publication:5045265
DOI10.26493/2590-9770.1511.AF5zbMATH Open1497.05088OpenAlexW4280597305MaRDI QIDQ5045265FDOQ5045265
Authors: Kijung Kim
Publication date: 4 November 2022
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1511.af5
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Dominator colorings and safe clique partitions
- Traversability and connectivity of the middle graph of a graph
- Dominated colorings of graphs
- Dominator coloring of Mycielskian graphs
- Dominator colorings in some classes of graphs
- Dominated and dominator colorings over (edge) corona and hierarchical products
- Dominator colorings of certain Cartesian products of paths and cycles
- Total domination number of middle graphs
Cited In (3)
This page was built for publication: The dominated chromatic number of middle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045265)