1 paper
Ryan McCulloch, Brendan D. McKay, Alireza Salahshoori +1
We prove that an inseparable graph can have any positive number of cycles with the six exceptions 2, 4, 5, 8, 9, 16, and that an inseparable cubic graph has the additional exceptio…