Queue layouts of planar 3-trees
A queue layout of a graph G consists of a linear order of the vertices of G and a partition of
the edges of G into queues, so that no two independent edges of the same queue are …
the edges of G into queues, so that no two independent edges of the same queue are …
Product structure of graph classes with bounded treewidth
Product structure of graph classes with bounded treewidth Page 1 Combinatorics, Probability
and Computing (2023), 1–26 doi:10.1017/S0963548323000457 ARTICLE Product structure of …
and Computing (2023), 1–26 doi:10.1017/S0963548323000457 ARTICLE Product structure of …
On the queue-number of graphs with bounded tree-width
V Wiechert - arxiv preprint arxiv:1608.06091, 2016 - arxiv.org
A queue layout of a graph consists of a linear order on the vertices and an assignment of the
edges to queues, such that no two edges in a single queue are nested. The minimum …
edges to queues, such that no two edges in a single queue are nested. The minimum …
Tree-partitions with bounded degree trees
M Distel, DR Wood - 2021-2022 MATRIX Annals, 2024 - Springer
A tree-partition of a graph G is a partition of V (G) such that identifying the vertices in each
part gives a tree. It is known that every graph with treewidth k and maximum degree Δ has a …
part gives a tree. It is known that every graph with treewidth k and maximum degree Δ has a …
[HTML][HTML] On tree-partition-width
DR Wood - European Journal of Combinatorics, 2009 - Elsevier
A tree-partition of a graph G is a proper partition of its vertex set into 'bags', such that
identifying the vertices in each bag produces a forest. The width of a tree-partition is the …
identifying the vertices in each bag produces a forest. The width of a tree-partition is the …
On the parameterized complexity of computing tree-partitions
We study the parameterized complexity of computing the tree-partition-width, a graph
parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand …
parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand …
[HTML][HTML] On the upward book thickness problem: combinatorial and complexity results
Among the vast literature concerning graph drawing and graph theory, linear layouts of
graphs have been the subject of intense research over the years, both from a combinatorial …
graphs have been the subject of intense research over the years, both from a combinatorial …
Product structure of graph classes with strongly sublinear separators
We investigate the product structure of hereditary graph classes admitting strongly sublinear
separators. We characterise such classes as subgraphs of the strong product of a star and a …
separators. We characterise such classes as subgraphs of the strong product of a star and a …
Beyond the classical monoscopic 3D in graph analytics: An experimental study of the impact of stereoscopy
Popular in the nineties, 3D visualization has since garnered much criticisms. While
historically the vast majority of 3D visualization evaluations have been based on the …
historically the vast majority of 3D visualization evaluations have been based on the …
Quasi-tree-partitions of graphs with an excluded subgraph
This paper studies the structure of graphs with given tree-width and excluding a fixed
complete bipartite subgraph, which generalises the bounded degree setting. We give a new …
complete bipartite subgraph, which generalises the bounded degree setting. We give a new …