Minimal classes of graphs of unbounded clique-width
From MaRDI portal
Publication:659655
Cites work
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A short proof that `proper = unit'
- An interval graph is a comparability graph
- Approximation algorithms for NP-complete problems on planar graphs
- Bandwidth of chain graphs
- Bipartite permutation graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Clique-width for 4-vertex forbidden subgraphs
- Clique-width minimization is NP-hard
- Decompositions for the edge colouring of reduced indifference graphs.
- Diameter and treewidth in minor-closed graph families
- Diameter and treewidth in minor-closed graph families, revisited
- Difference graphs
- Edge dominating set and colorings on graphs with fixed clique-width
- Graph minors. V. Excluding a planar graph
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 5720940 (Why is no real title available?)
- scientific article; zbMATH DE number 2159659 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Jump number maximization for proper interval graphs and series-parallel graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Local tree-width, excluded minors, and approximation algorithms
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- On semi-\(P_ 4\)-sparse graphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the clique-width of graph with few \(P_{4}\)'s
- On the clique-width of some perfect graph classes
- Optimal path cover problem on block graphs and bipartite permutation graphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Precoloring extension on unit interval graphs
- Proper interval graphs and the guard problem
- SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- The strong perfect graph theorem
- Upper bounds to the clique width of graphs
Cited in
(25)- Split permutation graphs
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Between clique-width and linear clique-width of bipartite graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Infinitely many minimal classes of graphs of unbounded clique-width
- Rationality for subclasses of 321-avoiding permutations
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Clique-width of path powers
- Linear clique-width for hereditary classes of cographs
- scientific article; zbMATH DE number 1439435 (Why is no real title available?)
- U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- A new graph construction of unbounded clique-width
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- On low rank-width colorings
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
- Critical properties of bipartite permutation graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- \(t\)-sails and sparse hereditary classes of unbounded tree-width
- MSO undecidability for hereditary classes of unbounded clique-width
- Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
- An overview of universal obstructions for graph parameters
- Graph classes with and without powers of bounded clique-width
- Bichain graphs: geometric model and universal graphs
This page was built for publication: Minimal classes of graphs of unbounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659655)
