A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Linear layouts measuring neighbourhoods in graphs

2006
*
Discrete Mathematics
*

In this paper we introduce the graph layout parameter neighbourhood-width as a variation of the well-known cut-width. The cut-width of a graph G = (V , E) is the smallest integer k, such that there is a linear layout : V → {1, . . . , |V |}, such that for every 1 i < |V | there are at most k edges {u, v} with (u) i and (v) > i. The neighbourhood-width of a graph is the smallest integer k, such that there is a linear layout , such that for every 1 i < |V | the vertices u with (u) i can be

doi:10.1016/j.disc.2006.03.048
fatcat:msxln5bidvbx7ocos7yiv7xnza