Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs
Authors:	ID Chlebíková, Janka (Author) ID Dallard, Clément Jean (Author)
Files:	https://link.springer.com/chapter/10.1007%2F978-3-030-25005-8_12
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	colorful component, caterpillar, binary tree, planar subcubic graph
Year of publishing:	2019
Number of pages:	Str. 136-147
PID:	20.500.12556/RUP-12406
UDC:	51
ISSN on article:	0302-9743
DOI:	10.1007/978-3-030-25005-8_12
COBISS.SI-ID:	1541803972
Publication date in RUP:	11.02.2020
Views:	1275
Downloads:	127
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Combinatorial algorithms
COBISS.SI-ID:	1541803716

Title:	Lecture notes in computer science
Shortened title:	Lect. notes comput. sci.
Publisher:	Springer
ISSN:	0302-9743
COBISS.SI-ID:	4292374

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back