scientific article; zbMATH DE number 1472167
From MaRDI portal
Publication:4489221
zbMath0951.05093MaRDI QIDQ4489221
Publication date: 17 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (36)
A local characterization of bounded clique-width for line graphs ⋮ Rank-width: algorithmic and structural results ⋮ Steiner trees for hereditary graph classes: a treewidth perspective ⋮ Unnamed Item ⋮ Bounding the mim‐width of hereditary graph classes ⋮ Efficient parameterized algorithms for computing all-pairs shortest paths ⋮ On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) ⋮ Graph classes with and without powers of bounded clique-width ⋮ Bounding clique-width via perfect graphs ⋮ Polynomial-time recognition of clique-width \(\leq 3\) graphs ⋮ The Clique-Width of Tree-Power and Leaf-Power Graphs ⋮ On switching classes, NLC-width, cliquewidth and treewidth ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Directed NLC-width ⋮ On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs ⋮ Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis ⋮ Line graphs of bounded clique-width ⋮ Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width ⋮ Computing the clique-width of cactus graphs ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ On a disparity between relative cliquewidth and relative NLC-width ⋮ On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth ⋮ Boolean-width of graphs ⋮ Vertex disjoint paths on clique-width bounded graphs ⋮ A model-theoretic characterisation of clique width ⋮ On the Boolean-Width of a Graph: Structure and Applications ⋮ Clique-width of graphs defined by one-vertex extensions ⋮ Bounding Clique-Width via Perfect Graphs ⋮ Unnamed Item ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ Graph operations characterizing rank-width ⋮ Unnamed Item ⋮ On the relationship between NLC-width and linear NLC-width ⋮ Edge dominating set and colorings on graphs with fixed clique-width ⋮ Knocking out \(P_k\)-free graphs
This page was built for publication:
