Connectivity check in 3-connected planar graphs with obstacles - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2008

Dates et versions

hal-00333863 , version 1 (24-10-2008)

Identifiants

Citer

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg. Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics, 2008, 31, pp.151-155. ⟨10.1016/j.endm.2008.06.030⟩. ⟨hal-00333863⟩

Collections

CNRS ANR
51 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More