Name
Abstract | ||
|---|---|---|
It is known that every weighted planar graph with n vertices contains three shortest paths whose removal halves the graph into connected components of at most n/2 vertices. Whether this property remains true with the use of two shortest paths only is an open problem. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.endm.2009.07.091 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
treewidth,planar graphs,path-separable | Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Clique-sum,Induced subgraph,Cograph,Book embedding,Pathwidth,1-planar graph,Mathematics | Journal |
Volume | ISSN | Citations |
34 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emilie Diot | 1 | 1 | 1.03 |
| Cyril Gavoille | 2 | 1526 | 114.20 |