Illya V. Hicks, Nolan B. Jr. McMurray
We prove a conjecture stating that the branchwidth of a graph and the branchwidth of the graph's cycle matroid are equal if the graph has a cycle of length at least 2.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados