58 search results - page 4 / 12 » Induced Ramsey-type theorems |
COMBINATORICS
2004
13 years 7 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
DAM
2002
13 years 7 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
IWCIA
2009
Springer
14 years 1 months ago
2009
Springer
This work is settled in the framework of abstract simplicial complexes. We propose a definition of a watershed and of a collapse for maps defined on pseudomanifolds of arbitrary ...
DM
1998
13 years 7 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
JCT
2006
13 years 7 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...