Clique‐cutsets beyond chordal graphs
From MaRDI portal
Publication:5379846
DOI10.1002/jgt.22428zbMath1414.05126OpenAlexW2906256108MaRDI QIDQ5379846
Kristina Vušković, Valerio Boncompagni, Irena Penev
Publication date: 14 June 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/119047/1/LAGOS2017-Manuscript36-revision.pdf
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem, Coloring rings, On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs, Coloring \((4K_1,C_4,C_6)\)-free graphs, On the tree-width of even-hole-free graphs, Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes, On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets