Complexity of restricted variant of star colouring

DOI10.1007/978-3-030-39219-2_1MaRDI QIDQ779165zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexitygraph coloringordered coloringrestricted star coloringstar coloringunique superior coloringvertex ranking

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Star colouring of bounded degree graphs and regular graphs
• The complexity of restricted star colouring
• scientific article; zbMATH DE number 5239161 (Why is no real title available?)
• Acyclic, star, and injective colouring: bounding the diameter
• Acyclic, star, and injective colouring: bounding the diameter
• The complexity of star colouring in bounded degree graphs and regular graphs
• Acyclic, star and injective colouring: a complexity picture for H-free 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)