Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:15, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and approximation for L-EPG and \(B_1\)-EPG graphs |
scientific article |
Statements
Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (English)
0 references
29 May 2020
0 references
B1-EPG graphs
0 references
edge intersection graph
0 references
paths on a grid
0 references
fully-subdivided graphs
0 references
\(k\)-simplicial graphs
0 references
