Clique-cutsets beyond chordal graphs
DOI10.1002/JGT.22428zbMATH Open1414.05126OpenAlexW2906256108MaRDI QIDQ5379846FDOQ5379846
Authors: Valerio Boncompagni, Irena Penev, Kristina Vušković 
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
Recommendations
- Clique cutsets beyond chordal graphs
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- The world of hereditary graph classes viewed through Truemper configurations
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring
- The (theta, wheel)-free graphs. II: Structure theorem
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Perfect graphs (05C17)
Cited In (11)
- Graphs with all holes the same length
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- Bisimplicial separators
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
- The world of hereditary graph classes viewed through Truemper configurations
- Coloring rings
- On the tree-width of even-hole-free graphs
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- Clique cutsets beyond chordal graphs
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Coloring \((4K_1,C_4,C_6)\)-free graphs
This page was built for publication: Clique-cutsets beyond chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5379846)
