20 search results - page 1 / 4 » Every rayless graph has an unfriendly partition |
COMBINATORICA
2010
12 years 11 months ago
2010
We prove that every rayless graph has an unfriendly partition.
SIAMCOMP
2002
13 years 4 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
GD
2004
Springer
13 years 10 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
JCT
2008
13 years 4 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
JGT
2007
13 years 4 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...