Necessary edges in k-chordalisations of graphs

DOI10.1023/A:1027320705349zbMATH Open1031.05120OpenAlexW2135382359WikidataQ59567885 ScholiaQ59567885MaRDI QIDQ1417852FDOQ1417852

Authors: Hans L. Bodlaender 

Publication date: 6 January 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1027320705349

Recommendations

• On strictly chordality-\(k\) graphs
• Edge (m,k)-choosability of graphs
• Edge clique graphs and some classes of chordal graphs
• On the chordality of a graph
• ON \((k, t)\)-edge-choosability of graphs
• Edge contractions in subclasses of chordal graphs
• Edge contractions in subclasses of chordal graphs
• Edge-colouring and total-colouring chordless graphs
• A generalization of chordal graphs
• On the hyperbolicity of edge-chordal and path-chordal graphs

zbMATH Keywords

treewidthgraph algorithmsinterval graphspathwidthchordal graphstriangulated graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Treewidth computations. II. Lower bounds
• Courcelle's theorem -- a game-theoretic approach
• Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
• A cubic kernel for feedback vertex set and loop cutset
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

This page was built for publication: Necessary edges in \(k\)-chordalisations of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1417852)