Necessary edges in \(k\)-chordalisations of graphs
type: Item
instance of: scholarly article
title: Necessary edges in \(k\)-chordalisations of graphs
zbMATH Open document ID: 1031.05120
DOI: 10.1023/A:1027320705349
published in: Journal of Combinatorial Optimization
publication date: 2004-01-06T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2021966
zbMATH Keywords: graph algorithms
zbMATH Keywords: chordal graphs
zbMATH Keywords: triangulated graphs
zbMATH Keywords: treewidth
zbMATH Keywords: interval graphs
zbMATH Keywords: pathwidth
author: Hans L. Bodlaender
MaRDI profile type: Publication
full work available at URL: a:1027320705349
OpenAlex ID: W2135382359
Wikidata QID: Q59567885
Recommended article: On strictly chordality-\(k\) graphs
Recommended article: Edge (m,k)-choosability of graphs
Recommended article: Edge clique graphs and some classes of chordal graphs
Recommended article: On the chordality of a graph
Recommended article: Q3190529
Recommended article: Edge Contractions in Subclasses of Chordal Graphs
Recommended article: Edge contractions in subclasses of chordal graphs
Recommended article: Edge-colouring and total-colouring chordless graphs
Recommended article: A generalization of chordal graphs
Recommended article: On the hyperbolicity of edge-chordal and path-chordal graphs
description: scientific article; zbMATH DE number 2021966