1 paper
Mark Kempton, Xavier Zaitzeff, Sibi Muthuprakash
We examine upper bounds on Nordhaus-Gaddum type problems for parameters related to graph connectivity. Our main result is that for a graph G on n vertices where both G and it…