On the complexity of rainbow vertex colouring diametral path graphs

DOI10.4230/LIPICS.ISAAC.2022.43MaRDI QIDQ6602464zbMATH OpenFDO

Authors Jakob Dyrseth, Paloma T. Lima

Publication date 11 September 2024

zbMATH Keywords

interval graphsdiametral path graphsrainbow vertex colouring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Asteroidal sets and dominating paths

This page was built for publication: On the complexity of rainbow vertex colouring diametral path graphs

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