Atoms versus avoiding simplicial vertices

DOI10.1007/978-3-031-92935-9_19MaRDI QIDQ6902100zbMATH OpenFDO

Authors Karl Boddy, Konrad Dabrowski, Daniël Paulusma

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_19

zbMATH Keywords

atomclique cut-setsimplicial vertex

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• Clique‐width: Harnessing the power of atoms
• Colouring square-free graphs without long induced paths
• Decomposition by clique separators
• Edge dominating set and colorings on graphs with fixed clique-width
• scientific article; zbMATH DE number 2044928 (Why is no real title available?)
• Linear time solvable optimization problems on graphs of bounded clique-width
• MSOL partitioning problems on graphs of bounded treewidth and clique-width
• On distance-3 matchings and induced matchings
• On easy and hard hereditary classes of graphs with respect to the independent set problem
• On rigid circuit graphs
• On the clique-width of graph with few \(P_{4}\)'s
• On the tree representation of chordal graphs
• Paw-free graphs

This page was built for publication: Atoms versus avoiding simplicial vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902100)