2432 search results - page 61 / 487 » Degrees and choice numbers |
141
click to vote
ENDM
2007
15 years 6 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
158
click to vote
SIAMDM
2010
15 years 4 months ago
2010
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
171
click to vote
EACL
2009
ACL Anthology
16 years 6 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
154
click to vote
DM
2008
15 years 6 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
186
click to vote
TOG
2002
15 years 5 months ago
2002
We discuss a method for creating animations that allows the animator to sketch an animation by setting a small number of keyframes on a fraction of the possible degrees of freedom...