725 search results - page 24 / 145 » Bounding Degrees on RPL |
JGT
2007
14 years 9 months ago
2007
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...
AAECC
2003
Springer
15 years 1 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
FOSSACS
2010
Springer
15 years 29 days ago
2010
Springer
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
TCS
2008
14 years 9 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
101
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...