Skip to main content

Cops and robbers on geometric graphs and graphs with a set of forbidden subgraphs

Resource type
Thesis type
(Thesis) Ph.D.
Date created
2019-06-18
Authors/Contributors
Abstract
In this thesis we study the game of cops and robbers on some special class of graphs, including planar graphs and geometric graphs. Moreover, under some conditions on graph diameter, we characterize all sets H of graphs with bounded diameter for which H-free graphs are cop-bounded. Furthermore, we extend our characterization to the case of cop-bounded classes of graphs defined by a set H of forbidden graphs such that the components of members of H have bounded diameter.
Identifier
etd20359
Copyright statement
Copyright is held by the author.
Permissions
This thesis may be printed or downloaded for non-commercial research and scholarly purposes.
Scholarly level
Supervisor or Senior Supervisor
Thesis advisor: Stacho, Ladislav
Thesis advisor: Mohar, Bojan
Member of collection
Model
English

Views & downloads - as of June 2023

Views: 75
Downloads: 0