Hi, I'm very new to graph theory and have a question.
For each positive integer $k$, what is the largest number of bridges in any $k$-vertex graph?
Thanks.
Hi, I'm very new to graph theory and have a question.
For each positive integer $k$, what is the largest number of bridges in any $k$-vertex graph?
Thanks.