Graph TheoryHardTrees
Trees · Hard problem
What is the smallest possible number of vertices in a connected (simple) graph in which every vertex has degree at least and the circuit rank (edges beyond a spanning tree) is exactly ?
What is the smallest possible number of vertices in a connected (simple) graph in which every vertex has degree at least and the circuit rank (edges beyond a spanning tree) is exactly ?