scientific article; zbMATH DE number 7204407
From MaRDI portal
Publication:5111290
DOI10.4230/LIPIcs.MFCS.2017.73zbMath1441.05193MaRDI QIDQ5111290
Victor Zamaraev, Konrad K. Dabrowski, Daniël Paulusma, Alexandre Blanché, Matthew Johnson, Vadim V. Lozin
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Subgraph complementation ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Partial complementation of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- The behavior of clique-width under graph operations and graph transformations
- Colouring vertices of triangle-free graphs without forests
- New graph classes of bounded clique-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Recent developments on graphs of bounded clique-width
- 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.
- Edge dominating set and colorings on graphs with fixed clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Clique-width for 4-vertex forbidden subgraphs
- Approximating clique-width and branch-width
- Bounding Clique-Width via Perfect Graphs
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
- Bounding the Clique-Width of H-free Chordal Graphs
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Clique-Width is NP-Complete
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- Improved Bounds for the Flat Wall Theorem
- Colouring Diamond-free Graphs.
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- On the Number of Self-Complementary Graphs and Digraphs
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Bounding the clique-width of \(H\)-free split graphs
This page was built for publication:
