Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Partitioning edges of a planar graph into linear forests and a matching

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:24:31Z
dc.abstract.plWe show that the edges of any planar graph of maximum degree at most 9 can be partitioned into 4 linear forests and a matching. Combined with known results, this implies that the edges of any planar graph G of odd maximum degree ∆ ≥ 9 can be partitioned into (∆−1)/2 linear forests and one matching. This strengthens well-known results stating that graphs in this class have chromatic index ∆ [Vizing, 1965] and linear arboricity at most ⌈(Δ+1)/2⌉.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorPilipczuk, Michał
dc.contributor.authorKowalik, Łukasz
dc.contributor.authorCzyżewska, Jadwiga
dc.contributor.authorBonamy, Marthe
dc.date.accessioned2024-01-25T16:21:42Z
dc.date.available2024-01-25T16:21:42Z
dc.date.issued2023
dc.description.financePublikacja bezkosztowa
dc.description.number3
dc.description.volume104
dc.identifier.doi10.1002/JGT.22995
dc.identifier.issn0364-9024
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/115551
dc.identifier.weblinkhttps://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22995
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofJournal of Graph Theory
dc.relation.pages659-677
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enCombinatorics
dc.subject.enDiscrete Mathematics
dc.titlePartitioning edges of a planar graph into linear forests and a matching
dc.typeJournalArticle
dspace.entity.typePublication