Linear connectivity forces large complete bipartite minors: an alternative approach

Link:
Autor/in:
Erscheinungsjahr:
2011
Medientyp:
Text
Schlagworte:
  • Complete bipartite minor
  • Euler's formula
  • Graph minor
  • Graphs on surfaces
  • Grid minor
  • Near embedding
  • Path-decomposition
  • Tree-decomposition
  • Tree-width
  • Vortex structure
Beschreibung:
  • The recent paper 'Linear connectivity forces large complete bipartite minors' by Böhme, Kawarabayashi, Maharry and Mohar relies on an extension of Robertson and Seymour's structure theorem for graphs with a forbidden minor. We describe a more direct approach which uses just the original structure theorem. © 2011 Elsevier Inc.
Lizenz:
  • info:eu-repo/semantics/openAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/5006571d-0145-477d-b36d-7bd0c87bf367