Every rayless graph has an unfriendly partition

Link:
Autor/in:
Erscheinungsjahr:
2009
Medientyp:
Text
Schlagworte:
  • Graph in graph theory
  • Global
  • Graph G
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • rayless graphs
  • unfriendly partition
  • Graph in graph theory
  • Global
  • Graph G
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • It is proved that every graph containing no infinite path has an unfriendly partition. © 2009 Elsevier B.V. All rights reserved.
Lizenz:
  • info:eu-repo/semantics/closedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/8d4c6b8d-5172-4560-bdb9-21feebd78ba1