Improved bounds for some facially constrained colorings

A facial-parity edge-coloring of a \(2\)-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a \(2\)-connected plane graph is a facially-proper vertex-coloring in which eve...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-05
1. Verfasser:	Kenny Štorgel
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Computer Science - Discrete Mathematics Graph coloring Graph theory Graphs Integers Mathematics - Combinatorics Parity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!