---
res:
  bibo_abstract:
  - The Hanani-Tutte theorem is a classical result proved for the first time in the
    1930s that characterizes planar graphs as graphs that admit a drawing in the plane
    in which every pair of edges not sharing a vertex cross an even number of times.
    We generalize this result to clustered graphs with two disjoint clusters, and
    show that a straightforward extension to flat clustered graphs with three or more
    disjoint clusters is not possible. For general clustered graphs we show a variant
    of the Hanani-Tutte theorem in the case when each cluster induces a connected
    subgraph. Di Battista and Frati proved that clustered planarity of embedded clustered
    graphs whose every face is incident to at most five vertices can be tested in
    polynomial time. We give a new and short proof of this result, using the matroid
    intersection algorithm.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Radoslav
      foaf_name: Fulek, Radoslav
      foaf_surname: Fulek
      foaf_workInfoHomepage: http://www.librecat.org/personId=39F3FFE4-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-8485-1774
  - foaf_Person:
      foaf_givenName: Jan
      foaf_name: Kynčl, Jan
      foaf_surname: Kynčl
  - foaf_Person:
      foaf_givenName: Igor
      foaf_name: Malinovič, Igor
      foaf_surname: Malinovič
  - foaf_Person:
      foaf_givenName: Dömötör
      foaf_name: Pálvölgyi, Dömötör
      foaf_surname: Pálvölgyi
  bibo_doi: 10.37236/5002
  bibo_issue: '4'
  bibo_volume: 22
  dct_date: 2015^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1077-8926
  dct_language: eng
  dct_publisher: Electronic Journal of Combinatorics@
  dct_title: Clustered planarity testing revisited@
...