Some completion problems for graphs without chordless cycles of prescribed lengths

Given a proper vertex coloring of a graph G, a supergraph that remains properly colored is called a completion of G. In this paper, we first consider the problem of determining whether a given properly colored graph has a C4-free completion, and completely classify the complexity of this problem bas...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2019-09, Vol.268, p.21-34
Hauptverfasser:	Busch, Arthur, Sritharan, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-free graphs Completion problem Graph coloring Polynomials Sandwich problem Satellites
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!