Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphsChlebíková, Janka (Avtor) Dallard, Clément Jean (Avtor) colorful componentcaterpillarbinary treeplanar subcubic graph20192020-02-11 08:40:03Neznano12406UDK: 51ISSN pri članku: 0302-9743OceCobissID: 1541803716DOI: 10.1007/978-3-030-25005-8_12COBISS.SI-ID: 1541803972sl