scientific article
From MaRDI portal
Publication:2766682
zbMath0988.68131MaRDI QIDQ2766682
Publication date: 9 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (42)
Acyclic coloring parameterized by directed clique-width ⋮ Computing L(p,1)-Labeling with Combined Parameters ⋮ Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree ⋮ On quasi-planar graphs: clique-width and logical description ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Parameterized edge Hamiltonicity ⋮ From tree-decompositions to clique-width terms ⋮ On the expressive power of CNF formulas of bounded tree- and clique-width ⋮ (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ Improved (In-)Approximability Bounds for d-Scattered Set ⋮ Graph classes with and without powers of bounded clique-width ⋮ Tree-width and the monadic quantifier hierarchy. ⋮ Long induced paths in minor-closed graph classes and beyond ⋮ Unnamed Item ⋮ Directed NLC-width ⋮ The Effect of Planarization on Width ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ Line graphs of bounded clique-width ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Circle graphs and monadic second-order logic ⋮ Computing the clique-width of cactus graphs ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Fly-automata for checking \(\mathrm{MSO}_2\) graph properties ⋮ Recent developments on graphs of bounded clique-width ⋮ Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Unnamed Item ⋮ Approximating clique-width and branch-width ⋮ Linear layouts measuring neighbourhoods in graphs ⋮ Vertex disjoint paths on clique-width bounded graphs ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ The Effect of Planarization on Width ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width ⋮ Dense Induced Subgraphs of Dense Bipartite Graphs ⋮ Unnamed Item ⋮ Comparing linear width parameters for directed graphs ⋮ On the relationship between NLC-width and linear NLC-width ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
This page was built for publication:
