Linear layouts measuring neighbourhoods in graphs
type: Item
instance of: scholarly article
title: Linear layouts measuring neighbourhoods in graphs
zbMATH Open document ID: 1103.68093
author: Frank Gurski
published in: Discrete Mathematics
publication date: 2006-09-13T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5053764
zbMATH Keywords: graph layout parameter neighbourhood-width
zbMATH Keywords: cut-width
MaRDI profile type: Publication
full work available at URL: j.disc.2006.03.048
OpenAlex ID: W2006729834
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Q4734761
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: The Pathwidth and Treewidth of Cographs
cites work: Graph Classes: A Survey
cites work: Graphs with small bandwidth and cutwidth
cites work: The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Upper bounds to the clique width of graphs
cites work: Deciding Clique-Width for Graphs of Bounded Tree-Width
cites work: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
cites work: Q2766682
cites work: Graph-Theoretic Concepts in Computer Science
cites work: On the relationship between NLC-width and linear NLC-width
cites work: The vertex separation number of a graph equals its path-width
cites work: Q3477966
cites work: Approximating clique-width and branch-width
cites work: Graph minors. I. Excluding a forest
cites work: Q3396557
cites work: \(k\)-NLC graphs and polynomial algorithms
DOI: 10.1016/J.DISC.2006.03.048
description: scientific article