Line graphs of bounded clique-width
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1617252 (Why is no real title available?)
- scientific article; zbMATH DE number 1696534 (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
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- An algebraic theory of graph reduction
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximating clique-width and branch-width
- Characterizations of derived graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Clique-width minimization is NP-hard
- Coloring powers of graphs of bounded clique-width.
- Complexity of Finding Embeddings in a k-Tree
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Edge dominating set and colorings on graphs with fixed clique-width
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Handbook of Graph Grammars and Computing by Graph Transformation
- LATIN 2004: Theoretical Informatics
- Linear time solvable optimization problems on graphs of bounded clique-width
- NLC\(_{2}\)-decomposition in polynomial time
- On simple characterizations of k-trees
- On the Relationship Between Clique-Width and Treewidth
- On the clique-width of some perfect graph classes
- On the relationship between NLC-width and linear NLC-width
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Upper bounds to the clique width of graphs
- Vertex disjoint paths on clique-width bounded graphs
- \(k\)-NLC graphs and polynomial algorithms
Cited in
(35)- Directed NLC-width
- XNLP-completeness for parameterized problems on graphs with a linear structure
- Comparing width parameters on graph classes
- Polynomial-time recognition of clique-width 3 graphs
- Critical elements in combinatorially closed families of graph classes
- On switching classes, NLC-width, cliquewidth and treewidth
- Graphs of linear clique-width at most 3
- scientific article; zbMATH DE number 7656024 (Why is no real title available?)
- Analytic approximations of statistical quantities and response of noisy oscillators
- Vertex disjoint paths on clique-width bounded graphs
- Computing the clique-width of cactus graphs
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Recent developments on graphs of bounded clique-width
- Excluding a bipartite circle graph from line graphs
- XNLP-completeness for parameterized problems on graphs with a linear structure
- The treewidth of line graphs
- Graph functionality
- A local characterization of bounded clique-width for line graphs
- The intersection of two vertex coloring problems
- Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- Graph classes with and without powers of bounded clique-width
- Clique width of partner limited graphs
- Treewidth of the line graph of a complete graph
- Compact labelings for efficient first-order model-checking
- Complexity classification of the edge coloring problem for a family of graph classes
- On the relationship between NLC-width and linear NLC-width
- Bounding clique-width via perfect graphs
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Bounding the clique-width of H-free chordal graphs
- Tree-Width and Optimization in Bounded Degree Graphs
- The behavior of clique-width under graph operations and graph transformations
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- On clique divergent graphs with linear growth
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Line graphs of bounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461201)
