Neighbourhood-width of trees
From MaRDI portal
Publication:501055
DOI10.1016/j.disc.2015.08.015zbMath1322.05039OpenAlexW1239382728MaRDI QIDQ501055
Eda Yilmaz, Frank Gurski, Stefan Neidig
Publication date: 8 October 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.08.015
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Graphs of linear clique-width at most 3
- Clique-width of graphs defined by one-vertex extensions
- Graph minors. I. Excluding a forest
- The vertex separation number of a graph equals its path-width
- The vertex separation and search number of a graph
- Tree-width, path-width, and cutwidth
- Linear layouts measuring neighbourhoods in graphs
- On the relationship between NLC-width and linear NLC-width
- Linear Rank-Width and Linear Clique-Width of Trees
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
- Clique-Width is NP-Complete
- A Complete Characterisation of the Linear Clique-Width of Path Powers
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- Graph minors. II. Algorithmic aspects of tree-width
- The Pathwidth and Treewidth of Cographs
This page was built for publication: Neighbourhood-width of trees
