Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths

In this paper, we show that every planar graph without $4$-cycles and $6$-cycles has a partition of its vertex set into two sets, where one set induces a forest, and the other induces a forest with maximum degree at most $2$ (equivalently, a disjoint union of paths). Note that we can partition the v...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Sittitrai, Pongpat, Nakprasit, Kittikorn
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!