On strict strong coloring of graphs
From MaRDI portal
Publication:5013494
DOI10.1142/S1793830921500403zbMath1475.05072OpenAlexW3107576741MaRDI QIDQ5013494
T. R. Ramesh Rao, A. Mohammed Abid
Publication date: 30 November 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500403
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dominator colorings in graphs
- A strict strong coloring of trees
- On graphs having domination number half their order
- Circular chromatic numbers of Mycielski's graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- Relations between the lower domination parameters and the chromatic number of a graph.
- Vertex colorings with a distance restriction
- Partial list colorings
- Total dominator chromatic number of some operations on a graph
- Total dominator colorings and total domination in graphs
- On some domination colorings of graphs
- Total domination and matching numbers in claw-free graphs
- On a property of the class of n-colorable graphs
- Algorithmic Aspects of Dominator Colorings in Graphs
- The circular chromatic number of the Mycielskian ofGdk
- Circular chromatic number and Mycielski construction
- The fractional chromatic number of mycielski's graphs
- Total dominator chromatic number of a graph
- A new kind of graph coloring
- Sur le coloriage des graphs
- Circular chromatic number and Mycielski graphs
- A lower bound on the chromatic number of Mycielski graphs
- Edge coloring of bipartite graphs with constraints
This page was built for publication: On strict strong coloring of graphs
