Neighbourhood-width of trees
type: Item
instance of: scholarly article
title: Neighbourhood-width of trees
zbMATH Open document ID: 1322.05039
author: Frank Gurski
author: Stefan Neidig
author: Eda Yilmaz
published in: Discrete Mathematics
publication date: 2015-10-08T00:00:00Z
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6492148
zbMATH Keywords: neighbourhood-width
zbMATH Keywords: path-width
MaRDI profile type: Publication
full work available at URL: j.disc.2015.08.015
OpenAlex ID: W1239382728
cites work: Linear Rank-Width and Linear Clique-Width of Trees
cites work: The Pathwidth and Treewidth of Cographs
cites work: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
cites work: Q3577833
cites work: The vertex separation and search number of a graph
cites work: Clique-Width is NP-Complete
cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
cites work: Linear layouts measuring neighbourhoods in graphs
cites work: On the relationship between NLC-width and linear NLC-width
cites work: A Complete Characterisation of the Linear Clique-Width of Path Powers
cites work: Graphs of linear clique-width at most 3
cites work: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
cites work: The vertex separation number of a graph equals its path-width
cites work: Tree-width, path-width, and cutwidth
cites work: Clique-width of graphs defined by one-vertex extensions
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Q4734768
cites work: Q2753956
DOI: 10.1016/J.DISC.2015.08.015
description: scientific article; zbMATH DE number 6492148