Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs

It is known that the class of all graphs not containing a graph \(H\) as an induced subgraph is cop-bounded if and only if \(H\) is a forest whose every component is a path. In this study, we characterize all sets \(\mathscr{H}\) of graphs with some \(k\in \mathbb{N}\) bounding the diameter of membe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-12
Hauptverfasser:	Masjoody, Masood, Stacho, Ladislav
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Graph theory Graphs Mathematics - Combinatorics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!