The Library
Every rayless graph has an unfriendly partition
Tools
Tools
Tools
Bruhn, Henning, Diestel, Reinhard, Georgakopoulos, Agelos and Sprüssel, Philipp (2009) Every rayless graph has an unfriendly partition. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 279-281. doi:10.1016/j.endm.2009.07.045 ISSN 1571-0653.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.endm.2009.07.045
Abstract
It is proved that every graph containing no infinite path has an unfriendly partition.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
| Journal or Publication Title: | Electronic Notes in Discrete Mathematics | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 1571-0653 | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.34 | ||||
| Page Range: | pp. 279-281 | ||||
| DOI: | 10.1016/j.endm.2009.07.045 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
