Complexity of restricted variant of star colouring

DOI10.1007/978-3-030-39219-2_1zbMATH Open1452.68141OpenAlexW3003044243MaRDI QIDQ779165FDOQ779165

Authors: M. A. Shalu, Cyriac Antony 

Publication date: 21 July 2020

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

Recommendations

• The complexity of restricted star colouring
• Some results concerning the complexity of restricted colorings of graphs
• Star colouring of bounded degree graphs and regular graphs
• A note on restricted \(H\)-colouring
• The Star and Biclique Coloring and Choosability Problems

zbMATH Keywords

complexitygraph coloringvertex rankingstar coloringordered coloringrestricted star coloringunique superior coloring

Mathematics Subject Classification ID

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

Cited In (6)

• Star colouring of bounded degree graphs and regular graphs
• Acyclic, star, and injective colouring: bounding the diameter
• Title not available (Why is that?)
• Acyclic, star, and injective colouring: bounding the diameter
• The complexity of restricted star colouring
• The complexity of star colouring in bounded degree graphs and regular graphs

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

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