Complexity of restricted variant of star colouring

DOI10.1007/978-3-030-39219-2_1zbMath1452.68141OpenAlexW3003044243MaRDI QIDQ779165

Cyriac Antony, M. A. Shalu

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_1

zbMATH Keywords

complexitygraph coloringvertex rankingstar coloringordered coloringrestricted star coloringunique superior coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

The complexity of restricted star colouring ⋮ The complexity of star colouring in bounded degree graphs and regular graphs ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Acyclic, star, and injective colouring: bounding the diameter

This page was built for publication: Complexity of restricted variant of star colouring