14 search results - page 3 / 3 » On planar intersection graphs with forbidden subgraphs |
APPML
2007
13 years 5 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
DCOSS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...