2 problems
Multigraph Overfull Conjecture. If
Let be a simple connected graph with maximum degree . The core is the subgraph induced by the vertices of degree , and .…
Multigraph Overfull Conjecture. If
Let be a simple connected graph with maximum degree . The core is the subgraph induced by the vertices of degree , and .…