Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)·!J.(G)·logn), and if ({Xj : iel] ,T=(I,A» is a tree decomposition of G with tree-wid~ then c (G) S (k+ l)·!J.(G)·c (T). In case that a tree decomposition is given, or that the tree-width is bo...

this study was carried out in order to determine the leave characteristics of some chestnut genotypes in the central black sea region of turkey and also to determine whether the leaf morphometric characteristics could be used for differentiation of genotypes. in this study, seven chestnut (castanea sativa mill.) genotypes (sa5-1, se 3-12, se 21-2, se 21-9, 552-8, 556-7 and 556-8) and one cultiv...

In the field of parameterized complexity theory, study graph width measures has been intimately connected with development width-based model checking algorithms for combinatorial properties on graphs. this work, we introduce a general framework to convert large class model-checking into that can be used test validity graph-theoretic conjectures classes graphs bounded width. Our is modular and a...

We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is 0 or 1. This implies that rank-width of a graph is less than or equal to branch-width of the graph unless the branch-width is 0. Moreover, this inequality is tight.

Yapılan çalışmada, AISI 304 paslanmaz sac malzemenin lazer kesim işleminde kesme parametrelerinin yüzey pürüzlülüğü, kerf genişliği ve çapak yüksekliği üzerine etkileri araştırılmıştır. Lazer iki farklı gaz basıncı (0.8 bar 1 bar), dört hızı (20 mm/sn, 24 28 mm/sn 32 mm/sn) frekans (3500 Hz, 4000 4500 Hz 5000 Hz) değerleri kullanılmıştır. Yüzey pürüzlülüğü ölçümleri, değişken parametreleriyle k...

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.

We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if their decomposition is given. Since decompositions of small width for our new notion can be computed in polynomial time for matroids of bounded branch-width r...

Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tract...

Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For p...