Repository logo
Article

Note on robust coloring of planar graphs

Simple item page
creativeworkseries.issn1232-9274
dc.contributor.authorKardoš, František
dc.contributor.authorLužar, Borut
dc.contributor.authorSoták, Roman
dc.date.available2025-04-10T09:20:11Z
dc.date.issued2025
dc.description.abstractWe consider the robust chromatic number $\chi_1(G)$ of planar graphs $G$ and show that there exists an infinite family of planar graphs $G$ with $\chi_1(G) = 3$, thus solving a recent problem of Bacsó et al. from [The robust chromatic number of graphs, Graphs Combin. 40 (2024), #89].en
dc.description.placeOfPublicationKraków
dc.description.versionwersja wydawnicza
dc.identifier.doihttps://doi.org/10.7494/OpMath.2025.45.1.103
dc.identifier.eissn2300-6919
dc.identifier.issn1232-9274
dc.identifier.urihttps://repo.agh.edu.pl/handle/AGH/112102
dc.language.isoeng
dc.publisherWydawnictwa AGH
dc.relation.ispartofOpuscula Mathematica
dc.rightsAttribution 4.0 International
dc.rights.accessotwarty dostęp
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/legalcode
dc.subjectrobust coloringen
dc.subjectrobust chromatic numberen
dc.subjectTutte graphen
dc.subjectplanar graphen
dc.titleNote on robust coloring of planar graphsen
dc.title.relatedOpuscula Mathematicaen
dc.typeartykuł
dspace.entity.typePublication
publicationissue.issueNumberNo. 1
publicationissue.paginationpp. 103-111
publicationvolume.volumeNumberVol. 45
relation.isJournalIssueOfPublicatione9ed1217-40d4-4680-aa75-e9feb21e8a2d
relation.isJournalIssueOfPublication.latestForDiscoverye9ed1217-40d4-4680-aa75-e9feb21e8a2d
relation.isJournalOfPublication304b3b9b-59b9-4830-9178-93a77e6afbc7

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
OpMath.2025.45.1.103.pdf
Size:
502.36 KB
Format:
Adobe Portable Document Format
Download

Collections

Artykuły (CN-OpMath)