On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
From MaRDI portal
Publication:6102271
DOI10.1007/978-3-030-95018-7_11OpenAlexW4207083889MaRDI QIDQ6102271
V. K. Kirubakaran, M. A. Shalu
Publication date: 8 May 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_11
Cites Work
- On dominator colorings in graphs
- On cd-coloring of trees and co-bipartite graphs
- Domination in convex and chordal bipartite graphs
- Dominating subgraphs in graphs with some forbidden structures
- On the complexity of cd-coloring of graphs
- Dominated colorings of graphs
- Dominated and dominator colorings over (edge) corona and hierarchical products
- The cd-Coloring of Graphs
- Parameterized and Exact Algorithms for Class Domination Coloring
- A Lower Bound of the cd-Chromatic Number and Its Complexity
- Algorithmic Aspects of Dominator Colorings in Graphs
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes
- Unnamed Item
- Unnamed Item
This page was built for publication: On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs