Abstract
We investigate here the intersection graphs of horizontal and vertical line segments in the plane, the so called B0-VPG graphs. A forbidden induced subgraph characterization of B0-VPG split graphs is given, and we present a linear time algorithm to recognize this class. Next, we characterize chordal bull-free B0-VPG graphs and chordal claw-free B0-VPG graphs.
Original language | English |
---|---|
Pages (from-to) | 499-517 |
Number of pages | 19 |
Journal | Graphs and Combinatorics |
Volume | 29 |
Issue number | 3 |
DOIs | |
State | Published - May 2013 |
Keywords
- 2-DIR graphs
- Chordal bull-free graphs
- Chordal claw-free graphs
- Rectangular grid
- Segment graphs
- Split graphs
- Vertex intersection graph
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics