scientific article; zbMATH DE number 7204407
From MaRDI portal
Publication:5111290
DOI10.4230/LIPICS.MFCS.2017.73zbMATH Open1441.05193MaRDI QIDQ5111290FDOQ5111290
Authors: Alexandre Blanché, Konrad Dabrowski, Matthew Johnson, Daniël Paulusma, Victor Zamaraev, Vadim Lozin 
Publication date: 26 May 2020
Title of this publication is not available (Why is that?)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Approximating clique-width and branch-width
- Clique-width is NP-complete
- Title not available (Why is that?)
- Recent developments on graphs of bounded clique-width
- Title not available (Why is that?)
- New graph classes of bounded clique-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Title not available (Why is that?)
- Clique-width for 4-vertex forbidden subgraphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- Edge dominating set and colorings on graphs with fixed clique-width
- Colouring of graphs with Ramsey-type forbidden subgraphs
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Colouring vertices of triangle-free graphs without forests
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tree- and clique-width of bipartite graphs in special classes
- 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
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Improved Bounds for the Flat Wall Theorem
- Bounding Clique-Width via Perfect Graphs
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
- Colouring Diamond-free Graphs.
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- Bounding the Clique-Width of H-free Chordal Graphs
- Classifying the clique-width of \(H\)-free bipartite graphs
- On the Number of Self-Complementary Graphs and Digraphs
- Bounding the clique-width of \(H\)-free split graphs
Cited In (13)
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Title not available (Why is that?)
- Characterization of classical graph classes by weighted clique graphs
- Computing the clique-width of cactus graphs
- Compact representation of graphs of small clique-width
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Clique-width of countable graphs: A compactness property.
- Clique-width of point configurations
- Inductive computations on graphs defined by clique-width expressions
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Partial complementation of graphs
- Treewidth versus clique number in graph classes with a forbidden structure
- Subgraph complementation
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 Q5111290)
