Coloring triangle-free L-graphs with (log log ) colors

2024
journal article
article
1
cris.lastimport.wos2024-04-09T21:33:52Z
dc.abstract.enIt is proved that triangle-free intersection graphs of $n$ L-shapes in the plane have chromatic number $O$(log log $n$) . This improves the previous bound of (McGuinness, 1996) and matches the known lower bound O(log $n$) construction (Pawlik et al., 2013).pl
dc.affiliationWydział Matematyki i Informatyki : Instytut Informatyki Analitycznejpl
dc.contributor.authorWalczak, Bartosz - 114113 pl
dc.date.accessioned2024-01-24T12:39:42Z
dc.date.available2024-01-24T12:39:42Z
dc.date.issued2024pl
dc.date.openaccess0
dc.description.accesstimew momencie opublikowania
dc.description.versionostateczna wersja wydawcy
dc.description.volume117pl
dc.identifier.articleid103831pl
dc.identifier.doi10.1016/j.ejc.2023.103831pl
dc.identifier.eissn1095-9971pl
dc.identifier.issn0195-6698pl
dc.identifier.urihttps://ruj.uj.edu.pl/xmlui/handle/item/326058
dc.languageengpl
dc.language.containerengpl
dc.rightsUdzielam licencji. Uznanie autorstwa 4.0 Międzynarodowa*
dc.rights.licenceCC-BY
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/legalcode.pl*
dc.share.typeinne
dc.subtypeArticlepl
dc.titleColoring triangle-free L-graphs with $O$(log log $n$) colorspl
dc.title.journalEuropean Journal of Combinatoricspl
dc.typeJournalArticlepl
dspace.entity.typePublication
cris.lastimport.wos
2024-04-09T21:33:52Z
dc.abstract.enpl
It is proved that triangle-free intersection graphs of $n$ L-shapes in the plane have chromatic number $O$(log log $n$) . This improves the previous bound of (McGuinness, 1996) and matches the known lower bound O(log $n$) construction (Pawlik et al., 2013).
dc.affiliationpl
Wydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
dc.contributor.authorpl
Walczak, Bartosz - 114113
dc.date.accessioned
2024-01-24T12:39:42Z
dc.date.available
2024-01-24T12:39:42Z
dc.date.issuedpl
2024
dc.date.openaccess
0
dc.description.accesstime
w momencie opublikowania
dc.description.version
ostateczna wersja wydawcy
dc.description.volumepl
117
dc.identifier.articleidpl
103831
dc.identifier.doipl
10.1016/j.ejc.2023.103831
dc.identifier.eissnpl
1095-9971
dc.identifier.issnpl
0195-6698
dc.identifier.uri
https://ruj.uj.edu.pl/xmlui/handle/item/326058
dc.languagepl
eng
dc.language.containerpl
eng
dc.rights*
Udzielam licencji. Uznanie autorstwa 4.0 Międzynarodowa
dc.rights.licence
CC-BY
dc.rights.uri*
http://creativecommons.org/licenses/by/4.0/legalcode.pl
dc.share.type
inne
dc.subtypepl
Article
dc.titlepl
Coloring triangle-free L-graphs with $O$(log log $n$) colors
dc.title.journalpl
European Journal of Combinatorics
dc.typepl
JournalArticle
dspace.entity.type
Publication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
0
Views per month
Downloads
walczak_coloring_triangle_free_lgraphs_2024.pdf
1