Connectivity check in 3-connected planar graphs with obstacles

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg. Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics, 31:151-155, 2008. [doi]

@article{CourcelleGKT08,
  title = {Connectivity check in 3-connected planar graphs with obstacles},
  author = {Bruno Courcelle and Cyril Gavoille and Mamadou Moustapha Kanté and Andrew Twigg},
  year = {2008},
  doi = {10.1016/j.endm.2008.06.030},
  url = {http://dx.doi.org/10.1016/j.endm.2008.06.030},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CourcelleGKT08},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Discrete Mathematics},
  volume = {31},
  pages = {151-155},
}