scientific article; zbMATH DE number 1979486
From MaRDI portal
Publication:4425939
Recommendations
Cited in
(41)- Clique-width and the speed of hereditary properties
- Complexity classification of the edge coloring problem for a family of graph classes
- Chordal bipartite graphs of bounded tree- and clique-width
- Critical properties of graphs of bounded clique-width
- Tree-width dichotomy
- On the structure of graphs without claw, \(4K_1\) and co-R
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- Colouring diamond-free graphs
- Bounding clique-width via perfect graphs
- NP-hard graph problems and boundary classes of graphs
- Bounding clique-width via perfect graphs
- Bounding the clique-width of H-free chordal graphs
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Graphs of separability at most two: structural characterizations and their consequences
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Graphs of separability at most 2
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem
- A new graph construction of unbounded clique-width
- scientific article; zbMATH DE number 7204407 (Why is no real title available?)
- Clique-width for graph classes closed under complementation
- Clique-width for hereditary graph classes
- Critical hereditary graph classes: a survey
- The behavior of clique-width under graph operations and graph transformations
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
- Critical elements in combinatorially closed families of graph classes
- scientific article; zbMATH DE number 7656024 (Why is no real title available?)
- The complexity of some graph problems with bounded minors of their constraint matrices
- Bounding the clique-width of \(H\)-free split graphs
- Bounding the mim‐width of hereditary graph classes
- Clique‐width: Harnessing the power of atoms
- Bounding the Mim-Width of Hereditary Graph Classes.
- Complexity framework for forbidden subgraphs. I: The framework
- Graph homomorphism, monotone classes and bounded pathwidth
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Complexity framework for forbidden subgraphs. II: Edge subdivision and the ``H-graphs
- Bounding width on graph classes of constant diameter
- Word-representable co-bipartite graphs: representation number, speed, and entropy
- Graph classes with and without powers of bounded clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Recent developments on graphs of bounded clique-width
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 Q4425939)
