scientific article; zbMATH DE number 1472167
From MaRDI portal
zbMATH Open0951.05093MaRDI QIDQ4489221FDOQ4489221
Authors: Öjvind Johansson 
Publication date: 17 October 2000
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (36)
- Directed NLC-width
- Bounding the Mim-Width of Hereditary Graph Classes.
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- On switching classes, NLC-width, cliquewidth and treewidth
- Title not available (Why is that?)
- Vertex disjoint paths on clique-width bounded graphs
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs
- Computing the clique-width of cactus graphs
- 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
- On the Boolean-width of a graph: structure and applications
- Edge dominating set and colorings on graphs with fixed clique-width
- Knocking out \(P_k\)-free graphs
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- Definable decompositions for graphs of bounded linear cliquewidth
- A local characterization of bounded clique-width for line graphs
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Bounding clique-width via perfect graphs
- Boolean-width of graphs
- Line graphs of bounded clique-width
- Graph operations characterizing rank-width
- Steiner trees for hereditary graph classes: a treewidth perspective
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Graph classes with and without powers of bounded clique-width
- Clique-width for graph classes closed under complementation
- Rank-width: algorithmic and structural results
- A model-theoretic characterisation of clique width
- On the relationship between NLC-width and linear NLC-width
- Bounding clique-width via perfect graphs
- Bounding the mim‐width of hereditary graph classes
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
- Clique-width of graphs defined by one-vertex extensions
- Title not available (Why is that?)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- The behavior of clique-width under graph operations and graph transformations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489221)
