Coloring bridge-free antiprismatic graphs

The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antiprismatic graphs, which are the complement of prismatic graphs and one of the four remaining cases highlighted by Lozin a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-08
Hauptverfasser:	Cléophée Robin, Robinson, Eileen
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Coloring Complexity Graph theory Graphs Polynomials Questions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!