Graph parameters measuring neighbourhoods in graphs-bounds and applications
type: Item
instance of: scholarly article
title: Graph parameters measuring neighbourhoods in graphs-bounds and applications
zbMATH Open document ID: 1200.05144
author: Frank Gurski
published in: Discrete Applied Mathematics
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 5324158
zbMATH Keywords: graph layout
zbMATH Keywords: neighbourhoods in graphs
zbMATH Keywords: VLSI
zbMATH Keywords: graph drawing
zbMATH Keywords: neighbourhood width
MaRDI profile type: Publication
full work available at URL: j.dam.2007.09.004
OpenAlex ID: W1974613721
cites work: Q3097395
cites work: Bull-free Berge graphs are perfect
cites work: An algorithm for finding homogeneous pairs
cites work: Clique-width minimization is NP-hard
cites work: Graph-Theoretic Concepts in Computer Science
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Linear layouts measuring neighbourhoods in graphs
cites work: On the relationship between NLC-width and linear NLC-width
cites work: Parallel concepts in graph theory
cites work: Q5677508
cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
cites work: Q3661483
cites work: On minimizing width in linear layouts
cites work: A polyhedral approach to planar augmentation and related problems
cites work: Cutwidth of the de Bruijn graph
cites work: Q3396557
cites work: On bipartite drawings and the linear arrangement problem
DOI: 10.1016/J.DAM.2007.09.004
description: scientific article; zbMATH DE number 5324158