Edge intersection graphs of \(L\)-shaped paths in grids

DOI10.1016/j.dam.2015.01.039zbMath1339.05381arXiv1204.5702OpenAlexW2152052626MaRDI QIDQ299080

Steven Chaplick, Chính T. Hoàng, Kathie Cameron

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5702

zbMATH Keywords

NP-completenesssplit graphsrecognition algorithms\(L\)-graphsedge intersection graphsgrid paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

On edge intersection graphs of paths with 2 bends ⋮ Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid ⋮ On independent set in \(B_1\)-EPG graphs ⋮ Hardness and approximation for L-EPG and \(B_1\)-EPG graphs ⋮ Edge-intersection graphs of boundary-generated paths in a grid ⋮ On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid ⋮ Edge-intersection graphs of grid paths: the bend-number ⋮ Unnamed Item

Cites Work

• Some properties of edge intersection graphs of single-bend paths on a grid
• The edge intersection graphs of paths in a tree
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Edge-intersection graphs of grid paths: the bend-number
• Approximation Algorithms for B 1-EPG Graphs
• Edge intersection graphs of single bend paths on a grid
• Reducibility among Combinatorial Problems

This page was built for publication: Edge intersection graphs of \(L\)-shaped paths in grids