Every rayless graph has an unfriendly partition

Angelos Georgakopoulos

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)521-532
JournalCombinatorica
Volume5
Publication statusPublished - 2010

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Theoretical

Cite this

Georgakopoulos, A. (2010). Every rayless graph has an unfriendly partition. Combinatorica, 5, 521-532.

Every rayless graph has an unfriendly partition. / Georgakopoulos, Angelos.

In: Combinatorica, Vol. 5, 2010, p. 521-532.

Research output: Contribution to journalArticleResearchpeer-review

Georgakopoulos, A 2010, 'Every rayless graph has an unfriendly partition' Combinatorica, vol. 5, pp. 521-532.
Georgakopoulos, Angelos. / Every rayless graph has an unfriendly partition. In: Combinatorica. 2010 ; Vol. 5. pp. 521-532.
@article{b87564154c124ac695b117fc325b4c44,
title = "Every rayless graph has an unfriendly partition",
author = "Angelos Georgakopoulos",
year = "2010",
language = "English",
volume = "5",
pages = "521--532",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",

}

TY - JOUR

T1 - Every rayless graph has an unfriendly partition

AU - Georgakopoulos, Angelos

PY - 2010

Y1 - 2010

M3 - Article

VL - 5

SP - 521

EP - 532

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

ER -