2-Layer Graph Drawings with Bounded Pathwidth

07/14/2022
by   David R. Wood, et al.
0

We determine which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2018

Doubly F-Bounded Generics

In this paper we suggest how f-bounded generics in nominally-typed OOP c...
research
09/22/2019

Surrounding cops and robbers on graphs of bounded genus

We consider a surrounding variant of cops and robbers on graphs of bound...
research
06/22/2015

GraphMaps: Browsing Large Graphs as Interactive Maps

Algorithms for laying out large graphs have seen significant progress in...
research
03/07/2023

Cops and Robbers on Multi-Layer Graphs

We generalise the popular cops and robbers game to multi-layer graphs, w...
research
07/31/2023

Boundedness for proper conflict-free and odd colorings

The proper conflict-free chromatic number, χ_pcf(G), of a graph G is the...
research
10/14/2022

Stability of Decentralized Queueing Networks Beyond Complete Bipartite Cases

Gaitonde and Tardos recently studied a model of queueing networks where ...
research
11/15/2019

Some remarks regarding finite bounded commutative BCK-algebras

In this chapter, starting from some results obtained in the papers [FV; ...

Please sign up or login with your details

Forgot password? Click here to reset