most citedTwin-width of Planar Graphs is at most 9, and at most 6 when Bipartite Planar

6 citations · 6 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2021

Isomorphism Testing for T-graphs in FPT

Deniz Ağaoğlu Çağırıcı, Petr Hliněný

A T-graph (a special case of a chordal graph) is the intersection graph of connected subtrees of a suitable subdivision of a fixed tree T . We deal with the isomorphism problem for…