38 search results - page 1 / 8 » Connectivity check in 3-connected planar graphs with obstacl... |
ENDM
2008
13 years 5 months ago
2008
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
SIAMDM
2000
13 years 4 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...