Linear Rank-Width of Distance-Hereditary Graphs

DOI10.1007/978-3-319-12340-0_4zbMath1417.05042OpenAlexW1495389205WikidataQ59898632 ScholiaQ59898632MaRDI QIDQ2945179

O-joung Kwon, Mamadou Moustapha Kanté, Isolde Adler

Publication date: 9 September 2015

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/105529/1/wg13-adler-kante.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph minors (05C83) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions, A Menger-like property of tree-cut width, Lean Tree-Cut Decompositions: Obstructions and Algorithms, Linear rank-width and linear clique-width of trees