Twin-distance-hereditary digraphs

DOI10.1016/j.tcs.2023.114009arXiv2112.04183OpenAlexW4379741177MaRDI QIDQ6132965

Dominique Komander, Carolin Rehs

Publication date: 21 July 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.04183

zbMATH Keywords

directed clique-widthdirected distance-hereditary graphsdirected width parameters

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
• Acyclic coloring parameterized by directed clique-width
• Directed NLC-width
• Digraph measures: Kelly decompositions, games, and orderings
• Distance-hereditary digraphs
• Distance-hereditary graphs
• Orientations of digraphs almost preserving diameter
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
• Upper bounds to the clique width of graphs
• Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
• How to compute digraph width measures on directed co-graphs
• Digraph width measures in parameterized algorithmics
• Fully dynamic recognition algorithm and certificate for directed cographs
• Rank-width and vertex-minors
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Classes of Directed Graphs
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Digraphs
• Directed Rank-Width and Displit Decomposition

This page was built for publication: Twin-distance-hereditary digraphs