Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid

Steven Chaplick, Elad Cohen, Juraj Stacho

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as b 0-vpg graphs. Recognizing these graphs is an np-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal b 0-vpg graphs, and for recognizing b 0-vpg graphs that have a representation on a grid with 2 rows.
Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science. WG 2011
EditorsP. Kolman, J. Kratochvil
Publication statusPublished - 2011
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science

Cite this