مرکز منطقه ای اطلاع رساني علوم و فناوري - Every rayless graph has an unfriendly partition

Title of article :

Every rayless graph has an unfriendly partition

Author/Authors :

Bruhn، نويسنده , , Henning and Diestel، نويسنده , , Reinhard and Georgakopoulos، نويسنده , , Agelos and Sprüssel، نويسنده , , Philipp، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2009

Pages :

From page :

279

To page :

281

Abstract :

It is proved that every graph containing no infinite path has an unfriendly partition.

Keywords :

rayless graphs , unfriendly partition

Journal title :

Electronic Notes in Discrete Mathematics

Serial Year :

2009

Journal title :

Electronic Notes in Discrete Mathematics

Record number :

1455129

Link To Document :