Clique cutsets beyond chordal graphs

DOI10.1016/j.endm.2017.10.015zbMath1383.05227arXiv1707.03252OpenAlexW2963702879WikidataQ59886554 ScholiaQ59886554MaRDI QIDQ2413155

Valerio Boncompagni, Irena Penev, Kristina Vušković

Publication date: 9 April 2018

Full work available at URL: https://arxiv.org/abs/1707.03252

zbMATH Keywords

algorithmsstable setcliquevertex coloringstructure

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Colouring square-free graphs without long induced paths

Cites Work

• Unnamed Item
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Decomposition by clique separators
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Isolating Highly Connected Induced Subgraphs
• The world of hereditary graph classes viewed through Truemper configurations

This page was built for publication: Clique cutsets beyond chordal graphs