Treewidth versus clique number in graph classes with a forbidden structure

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Treewidth versus clique number in graph classes with a forbidden structure
Authors:	ID Dallard, Clément Jean (Author) ID Milanič, Martin (Author) ID Štorgel, Kenny (Author)
Files:	https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_8
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	graph class, treewidth, clique number
Year of publishing:	2020
Number of pages:	Str. 92-105
PID:	20.500.12556/RUP-14265
UDC:	519.17:004
ISSN on article:	0302-9743
DOI:	10.1007/978-3-030-60440-0_8
COBISS.SI-ID:	36187651
Publication date in RUP:	09.11.2020
Views:	1746
Downloads:	36
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:	Graph-theoretic concepts in computer science
COBISS.SI-ID:	36184067

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

Language:	English
Keywords:	razred grafov, drevesna širina, klično število

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back