I,F-partitions of sparse graphs

A stark-coloring is a proper k-coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to partition the vertex set into a 2-independent set and a forest; such...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of combinatorics 2016-10, Vol.57, p.1-12
Hauptverfasser:	Brandt, Axel, Ferrara, Michael, Kumbhat, Mohit, Loeb, Sarah, Stolee, Derrick, Yancey, Matthew
Format:	Artikel
Sprache:	eng
Schlagworte:	Color Combinatorial analysis Forests Graphs Mathematical analysis Partitions Stars Unions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!