Excluding Induced Paths: Graph Structure and Coloring
An induced subgraph of a given graph is any graph which can be obtained by successively deleting vertices, possible none. In this thesis, we present several new structural and algorithmic results on a number of different classes of graphs which are closed under taking induced subgraphs. The fi...
Main Author: | Maceli, Peter Lawson |
---|---|
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://doi.org/10.7916/D8WW7GK4 |
Similar Items
-
On eliminating square paths in a square lattice
by: Williams, Nikki LaTrina
Published: (2009) -
Graph Structure and Coloring
by: Plumettaz, Matthieu
Published: (2014) -
Some Problems in Graph Theory and Scheduling
by: Zhong, Mingxian
Published: (2018) -
Deciding st-connectivity in undirected graphs using logarithmic space
by: Maceli, Peter Lawson
Published: (2008) -
Graph embeddings and approximate graph coloring
by: Labelle, François.
Published: (2000)