Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COMBINATORICA
2010

favoriteEmaildiscussreport

121views Machine Learning» more COMBINATORICA 2010»

Every rayless graph has an unfriendly partition

12 years 11 months ago

Every rayless graph has an unfriendly partition

Download www.math.uni-hamburg.de

We prove that every rayless graph has an unfriendly partition.

Henning Bruhn, Reinhard Diestel, Agelos Georgakopo

Real-time Traffic

COMBINATORICA 2010 | Machine Learning | Rayless Graph |

claim paper

Related Content

» Approximating the Domatic Number

» Partitions of Complete Geometric Graphs into Plane Trees

» Decomposing Berge graphs and detecting balanced skew partitions

» Vertex partitions and maximum degenerate subgraphs

» Convex Partitions with 2Edge Connected Dual Graphs

» Vertex partitions of chordal graphs

» Clustering with Local Restrictions

» Layouts of Graph Subdivisions

» BoundedDegree Graphs have Arbitrarily Large Geometric Thickness

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2010
Where	COMBINATORICA
Authors	Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel

Comments (0)