Linear layouts measuring neighbourhoods in graphs
Author:
- 1 August 2006
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (15) , 1637-1650
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operationsDiscrete Mathematics, 2006
- On the relationship between NLC-width and linear NLC-widthTheoretical Computer Science, 2005
- A survey of graph layout problemsACM Computing Surveys, 2002
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- k-NLC graphs and polynomial algorithmsDiscrete Applied Mathematics, 1994
- Monadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science, 1993
- The vertex separation number of a graph equals its path-widthInformation Processing Letters, 1992
- Graphs with small bandwidth and cutwidthDiscrete Mathematics, 1989