Every rayless graph has an unfriendly partition

Link:
Autor/in:
Erscheinungsjahr:
2010
Medientyp:
Text
Schlagworte:
  • Graph in graph theory
  • Global
  • Graph G
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Graph in graph theory
  • Global
  • Graph G
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • We prove that every rayless graph has an unfriendly partition.
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/7317e3a1-fc52-43fc-9395-79925449556b