Recognizing digraphs of Kelly-width 2

DOI10.1016/j.dam.2009.09.018zbMath1216.05160OpenAlexW2024884639MaRDI QIDQ972333

Jan Arne Telle, Daniel Meister, Martin Vatshelle

Publication date: 25 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.018

zbMATH Keywords

characterizationrecognitionKelly-widthdigraph width parameter

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Chordal digraphs ⋮ Digraphs of bounded elimination width ⋮ Forbidden directed minors and Kelly-width ⋮ Directed width parameters and circumference of digraphs ⋮ Digraphs of Bounded Width

Cites Work

• Forbidden minors characterization of partial 3-trees
• Digraph measures: Kelly decompositions, games, and orderings
• All structured programs have small tree width and good register allocation
• Fugitive-search games on graphs and related parameters
• Directed tree-width
• Treewidth: Characterizations, Applications, and Computations
• DAG-width
• DAG-Width and Parity Games
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Recognizing digraphs of Kelly-width 2