The cd-Coloring of Graphs

DOI10.1007/978-3-319-29221-2_29zbMath1437.05078OpenAlexW2404880248MaRDI QIDQ2795960

T. P. Sandhya, M. A. Shalu

Publication date: 23 March 2016

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_29

zbMATH Keywords

time complexityvertex coloringsplit graphscd-coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

On cd-coloring of trees and co-bipartite graphs ⋮ Parameterized and exact algorithms for class domination coloring ⋮ On the complexity of cd-coloring of graphs ⋮ On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs ⋮ On CD-chromatic number and its lower bound in some classes of graphs ⋮ Parameterized and Exact Algorithms for Class Domination Coloring ⋮ A Lower Bound of the cd-Chromatic Number and Its Complexity ⋮ On the algorithmic aspects of strong subcoloring

Cites Work

• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Complexity of graph partition problems
• Algorithmic Aspects of Dominator Colorings in Graphs
• Four classes of perfectly orderable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The cd-Coloring of Graphs