Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
نویسندگان
چکیده
منابع مشابه
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomialtime algorithm, Algorithmica 78(1):342–377, 2017], we presented a characterization of the linear rank-width of distance-hereditary graphs, from which we derived an algorithm to compute it in polynomial time. In this paper, we investigate structural properties of distance-hereditary graphs based on this charac...
متن کاملLinear Rank-Width of Distance-Hereditary Graphs
We present a characterization of the linear rank-width of distancehereditary graphs. Using the characterization, we show that the linear rankwidth of every n-vertex distance-hereditary graph can be computed in time O(n · log(n)), and a linear layout witnessing the linear rank-width can be computed with the same time complexity. For our characterization, we combine modifications of canonical spl...
متن کاملRank-width and tree-width of H-minor-free graphs
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for other graph classes such as Kr-minor free graphs and graphs of bounded genus.
متن کاملCOMPUTATION OF LINEAR RANK-WIDTH Keywords: linear rank-width; rank-decomposition; path-decomposition; vertex-minor Internship at Limos, Clermont-Ferrand, supervised by
(1) It is equivalent to clique-width, a complexity measure introduced by Courcelle et al. [4], that generalises the well-known complexity measure tree-width introduced by Robertson and Seymour in their graph minors series. (2) It is algorithmically more interesting than clique-width because we can recognise in polynomial time graphs of rank-width at most k (for fixed k) (3) It shares with tree-...
متن کاملExcluded vertex-minors for graphs of linear rank-width at most k
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each k, there is a finite obstruction set Ok of graphs such that a graph G has linear rank-width at most k if and only if no vertex-minor of G is isomorphic to a graph in Ok. However, no attempts have been made to bound the number of gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2018
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.07.009