The complexity of star colouring in bounded degree graphs and regular graphs

DOI10.1007/978-3-030-95018-7_7OpenAlexW4206961601MaRDI QIDQ6102265

M. A. Shalu, Cyriac Antony

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_7

zbMATH Keywords

complexitygraph coloringvertex coloringstar coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On structural parameterizations of star coloring

Cites Work

• Unnamed Item
• Star coloring of cubic graphs
• Colouring graphs when the number of colours is almost the maximum degree
• Acyclic and star colorings of cographs
• Complexity of restricted variant of star colouring
• Coloring with no 2-colored \(P_4\)'s
• A polynomial time algorithm to find the star chromatic index of trees
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• Star chromatic index of subcubic multigraphs
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• Acyclic colorings of planar graphs

This page was built for publication: The complexity of star colouring in bounded degree graphs and regular graphs