1027 search results - page 2 / 206 » Ordered Vertex Partitioning |
JCT
1998
13 years 6 months ago
1998
Given a tournament score sequence s1 ≥ s2 ≥ · · · ≥ sn, we prove that there exists a tournament T on vertex set {1, 2, . . . , n} such that the degree of any vertex i is ...
COMBINATORICA
2006
13 years 6 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
CJCDGCGT
2005
Springer
13 years 8 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
JDA
2008
13 years 6 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...