DC Field
Value
Language
dc.contributor.author
Dreier, Jan
-
dc.contributor.author
Gajarský, Jakub
-
dc.contributor.author
Jiang, Yiting
-
dc.contributor.author
Ossona de Mendez, Patrice
-
dc.contributor.author
Raymond, Jean-Florent
-
dc.date.accessioned
2023-01-31T15:55:43Z
-
dc.date.available
2023-01-31T15:55:43Z
-
dc.date.issued
2022-03
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Dreier, J., Gajarský, J., Jiang, Y., Ossona de Mendez, P., &#38; Raymond, J.-F. (2022). Twin-width and generalized coloring numbers. <i>Discrete Mathematics</i>, <i>345</i>(3), Article 112746. https://doi.org/10.1016/j.disc.2021.112746</div> </div>
-
dc.identifier.issn
0012-365X
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/144395
-
dc.description.abstract
In this paper, we prove that a graph G with no Ks,s-subgraph and twin-width d has r-admissibility and r-coloring numbers bounded from above by an exponential function of r and that we can construct graphs achieving such a dependency in r.
en
dc.language.iso
en
-
dc.publisher
ELSEVIER
-
dc.relation.ispartof
Discrete Mathematics
-
dc.subject
Generalized coloring numbers
en
dc.subject
Twin-width
en
dc.subject
Permutations
en
dc.subject
bounded expansion
en
dc.subject
admissibility
en
dc.title
Twin-width and generalized coloring numbers
en
dc.type
Article
en
dc.type
Artikel
de
dc.identifier.scopus
2-s2.0-85120635401
-
dc.identifier.url
https://api.elsevier.com/content/abstract/scopus_id/85120635401
-
dc.contributor.affiliation
University of Warsaw, Poland
-
dc.contributor.affiliation
Université Paris Cité, France
-
dc.contributor.affiliation
Centre d'Analyse et de Mathématique Sociales, France
-
dc.contributor.affiliation
CNRS, LIMOS, Université Clermont Auvergne, France
-
dcterms.dateSubmitted
2021-05-11
-
dc.type.category
Original Research Article
-
tuw.container.volume
345
-
tuw.container.issue
3
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
wb.publication.intCoWork
International Co-publication
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Discrete Mathematics
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.1016/j.disc.2021.112746
-
dc.date.onlinefirst
2021-12-08
-
dc.identifier.articleid
112746
-
dc.identifier.eissn
1872-681X
-
dc.description.numberOfPages
8
-
tuw.author.orcid
0000-0002-2662-5303
-
tuw.author.orcid
0000-0003-0724-3729
-
tuw.author.orcid
0000-0003-4646-7602
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.languageiso639-1
en
-
item.fulltext
no Fulltext
-
item.grantfulltext
restricted
-
item.openairetype
research article
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
University of Warsaw
-
crisitem.author.dept
Universit� Paris Cit�
-
crisitem.author.dept
Centre d'Analyse et de Mathématique Sociales
-
crisitem.author.dept
CNRS, LIMOS, Université Clermont Auvergne, France
-
crisitem.author.orcid
0000-0002-2662-5303
-
crisitem.author.orcid
0000-0003-0724-3729
-
crisitem.author.orcid
0000-0003-4646-7602
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
Appears in Collections:
Article
Show simple item record

Page view(s)

226
checked on Nov 23, 2023

Download(s)

7
checked on Nov 23, 2023

Google ScholarTM

Check