On the relationship between NLC-width and linear NLC-width
From MaRDI portal
Publication:2576869
Recommendations
Cites work
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1953082 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 1512682 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Coloring powers of graphs of bounded clique-width.
- Complement reducible graphs
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Edge dominating set and colorings on graphs with fixed clique-width
- Graph Classes: A Survey
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- NLC\(_{2}\)-decomposition in polynomial time
- On a property of the class of n-colorable graphs
- On the clique-width of some perfect graph classes
- The relative clique-width of a graph
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
- Upper bounds to the clique width of graphs
- \(k\)-NLC graphs and polynomial algorithms
Cited in
(29)- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- On switching classes, NLC-width, cliquewidth and treewidth
- Graphs of linear clique-width at most 3
- On a disparity between relative cliquewidth and relative NLC-width
- A local characterization of bounded clique-width for line graphs
- Definable decompositions for graphs of bounded linear cliquewidth
- Linear rank-width and linear clique-width of trees
- Comparing linear width parameters for directed graphs
- Scattered classes of graphs
- Clique-width with an inactive label
- Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings
- Line graphs of bounded clique-width
- Characterizations for restricted graphs of NLC-width 2
- Directed width parameters on semicomplete digraphs
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Well-quasi-ordering does not imply bounded clique-width
- Linear layouts measuring neighbourhoods in graphs
- The relative clique-width of a graph
- Linear Recurrence Relations for Graph Polynomials
- Between clique-width and linear clique-width of bipartite graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Linear clique-width for hereditary classes of cographs
- Neighbourhood-width of trees
- THE RESEARCH PROGRESS OF BNU GROUP ON RELATIVE WIDTHS
- Graphs of Linear Clique-Width at Most 3
- The behavior of clique-width under graph operations and graph transformations
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: On the relationship between NLC-width and linear NLC-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576869)
