Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter
From MaRDI portal
Publication:6383756
DOI10.1016/j.tcs.2022.07.034arXiv2111.11897MaRDI QIDQ6383756
Daniël Paulusma, Siani Smith, Barnaby Martin
Publication date: 23 November 2021
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)
