Name
Abstract | ||
|---|---|---|
We prove that every planar graph is an intersection graph of strings in the plane such that any two strings intersect at most once. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00454-009-9196-9 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Planar graphs,Strings | Discrete mathematics,Topology,Combinatorics,Outerplanar graph,Line graph,Forbidden graph characterization,Planar straight-line graph,Intersection graph,String graph,Book embedding,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
43 | 3 | 0179-5376 |
Citations | PageRank | References |
1 | 0.35 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jérémie Chalopin | 1 | 364 | 32.39 |
| Daniel Gonçalves | 2 | 63 | 7.57 |
| Pascal Ochem | 3 | 258 | 36.91 |