Vertex intersection graphs of paths on a grid: characterization within block graphs
Combinatorics
2015-11-02 v1
Abstract
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called -VPG graphs. Recognizing this class is an NP-complete problem. Although, there exists a polynomial time algorithm for recognizing chordal -VPG graphs. In this paper, we present a minimal forbidden induced subgraph characterization of -VPG graphs restricted to block graphs. As a byproduct, the proof of the main theorem provides an alternative certifying recognition and representation algorithm for -VPG graphs in the class of block graphs.
Keywords
Cite
@article{arxiv.1510.09174,
title = {Vertex intersection graphs of paths on a grid: characterization within block graphs},
author = {L. Alcón and F. Bonomo and M. P. Mazzoleni},
journal= {arXiv preprint arXiv:1510.09174},
year = {2015}
}