Characterising Chordal Contact B_0 -VPG Graphs

@inproceedings{Bonomo2018CharacterisingCC,
  title={Characterising Chordal Contact B_0 -VPG Graphs},
  author={Flavia Bonomo and Mar{\'i}a P{\'i}a Mazzoleni and Mariano Leonardo Rean and Bernard Ries},
  booktitle={ISCO},
  year={2018}
}
A graph G is a \(B_0\)-VPG graph if it is the vertex intersection graph of horizontal and vertical paths on a grid. A graph G is a contact \(B_0\)-VPG graph if the vertices can be represented by interiorly disjoint horizontal or vertical paths on a grid and two vertices are adjacent if and only if the corresponding paths touch. In this paper, we present a minimal forbidden induced subgraph characterisation of contact \(B_0\)-VPG graphs within the class of chordal graphs and provide a polynomial… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS