Classifying rankwidth k-dh-graphs

DOI10.1007/978-3-642-13182-0_18zbMATH Open1284.05291OpenAlexW1583994553MaRDI QIDQ3569743FDOQ3569743

Authors: Ling-Ju Hung, Ton Kloks 

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_18

Recommendations

• Linear rank-width of distance-hereditary graphs
• On an extension of distance hereditary graphs
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
• scientific article; zbMATH DE number 815104
• On an extension of distance-hereditary graphs

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (2)

• The Weisfeiler-Leman dimension of distance-hereditary graphs
• Title not available (Why is that?)

This page was built for publication: Classifying rankwidth \(k\)-dh-graphs

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