scientific article; zbMATH DE number 2191997
From MaRDI portal
Publication:5463359
zbMath1076.05066MaRDI QIDQ5463359
Andreas Brandstädt, Vadim V. Lozin
Publication date: 4 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Uncountably many minimal hereditary classes of graphs of unbounded clique-width ⋮ A Survey on Spanning Tree Congestion ⋮ Labelled well-quasi-order for permutation classes ⋮ Linear structure of bipartite permutation graphs and the longest path problem ⋮ \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs ⋮ Linear-time algorithms for counting independent sets in bipartite permutation graphs ⋮ Satisfiability of acyclic and almost acyclic CNF formulas ⋮ Infinitely many minimal classes of graphs of unbounded clique-width ⋮ Between clique-width and linear clique-width of bipartite graphs ⋮ Permutation bigraphs and interval containments ⋮ Dynamic coloring on restricted graph classes ⋮ Graph classes with and without powers of bounded clique-width ⋮ Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs ⋮ Independent domination in finitely defined classes of graphs ⋮ Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ List homomorphism: beyond the known boundaries ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Minimal classes of graphs of unbounded clique-width ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) ⋮ A new graph construction of unbounded clique-width ⋮ Exact algorithms for minimum weighted dominating induced matching ⋮ Recent developments on graphs of bounded clique-width ⋮ Split permutation graphs ⋮ On the complexity of the dominating induced matching problem in hereditary classes of graphs ⋮ Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time ⋮ Quasimonotone graphs ⋮ Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem ⋮ On list \(k\)-coloring convex bipartite graphs ⋮ Graph Classes with Structured Neighborhoods and Algorithmic Applications ⋮ Chordal bipartite graphs of bounded tree- and clique-width
This page was built for publication:
