The branchwidth of graphs and their cycle matroids

• Autores: Illya V. Hicks, Nolan B. Jr. McMurray
• Localización: Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 97, Nº. 5, 2007, págs. 681-692
• Idioma: inglés
• DOI: 10.1016/j.jctb.2006.12.007
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.