On cd-coloring of \P₅,K₄\-free chordal graphs

DOI10.1007/978-3-030-95018-7_11MaRDI QIDQ6102271zbMATH OpenOpenAlexFDO

Authors M. A. Shalu, V. K. Kirubakaran

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• The chromatic number of \(\{P_5,K_4\}\)-free graphs
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
• On the chromatic number of some \(P_5\)-free graphs
• A Note on k-Colorability of P 5-Free Graphs
• On 3-coloring of \((2P_4,C_5)\)-free graphs
• On 3-coloring of \((2P_4,C_5)\)-free graphs
• On the chromatic number of (P5,dart)-free graphs
• On chromatic number of \(\{2K_1+K_2,C_4\}\)-free graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs

Cites work

• A lower bound of the cd-chromatic number and its complexity
• Algorithmic aspects of dominator colorings in graphs
• Dominated and dominator colorings over (edge) corona and hierarchical products
• Dominated colorings of graphs
• Dominating subgraphs in graphs with some forbidden structures
• Domination in convex and chordal bipartite graphs
• Domination integrity of middle graphs
• Dominator colorings and safe clique partitions
• Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes
• On cd-coloring of trees and co-bipartite graphs
• On dominator colorings in graphs
• On the complexity of cd-coloring of graphs
• Parameterized and exact algorithms for class domination coloring
• The cd-coloring of graphs

This page was built for publication: On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102271)