Characterising AT-free graphs with BFS

DOI10.1007/978-3-030-00256-5_2OpenAlexW2883590756MaRDI QIDQ1627146

Jesse Beisegel

Publication date: 22 November 2018

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Recognizing graph search trees ⋮ The Recognition Problem of Graph Search Trees

This page was built for publication: Characterising AT-free graphs with BFS