Maximal chordal subgraphs
From MaRDI portal
Publication:6632773
DOI10.1017/s0963548323000068MaRDI QIDQ6632773
Lior Gishboliner, Benny Sudakov
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a theorem of Rademacher-Turán
- The size of chordal, interval and threshold subgraphs
- Algorithmic graph theory and perfect graphs
- Extremal graphs for intersecting triangles
- The sum of degrees in cliques
- Complete subgraphs with large degree sums
- The Largest Vertex Degree Sum for a Triangle in a Graph
- On the number of complete subgraphs and circuits contained in graphs
- Extensions of Turán's theorem on graphs
This page was built for publication: Maximal chordal subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632773)