On split B₁-EPG graphs
From MaRDI portal
Publication:2294698
DOI10.1007/978-3-319-77404-6_27zbMATH Open1485.05157OpenAlexW2792410544MaRDI QIDQ2294698FDOQ2294698
Authors: Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl 
Publication date: 12 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_27
Recommendations
- Graphs of edge-intersecting and non-splitting one bend paths in a grid
- Edge intersection graphs of \(L\)-shaped paths in grids
- Some properties of edge intersection graphs of single-bend paths on a grid
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- scientific article; zbMATH DE number 7272507
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Cited In (8)
- Graphs of edge-intersecting and non-splitting one bend paths in a grid
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
- Characterizations of cographs as intersection graphs of paths on a grid
- On independent set in \(B_1\)-EPG graphs
- Title not available (Why is that?)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- Clique coloring \(B_1\)-EPG graphs
This page was built for publication: On split \(B_1\)-EPG graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294698)
