1749 search results - page 177 / 350 » Conditional colorings of graphs |
148
click to vote
SIAMCO
2000
15 years 6 months ago
2000
Given a nonlinear function h separating a convex and a concave function, we provide various conditions under which there exists an affine separating function whose graph is somewhe...
230
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
134
click to vote
MFCS
2004
Springer
16 years 9 hour ago
2004
Springer
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
166
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
212
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...