HIGHLIGHTS
- What: The authors show how Theorem 4 implies Theorem 2 (with the help of some tools from_[4]) in Section 4.
- Who: Skinny Ladders and colleagues from the ArxivUniversity of Warsaw, Poland have published the research work: Taming Graphs with No Large Creatures and Skinny Ladders, in the Preprint: Arxiv
SUMMARY
Which restrictions on graphs guarantee a small number of minimal separators? On one hand, it is easy to see that an n-vertex chordal graph has O(n) minimal separators. In 2019, Milanič and Pivač initiated a systematic study of . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.