1749 search results - page 149 / 350 » Conditional colorings of graphs |
168
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
204
click to vote
COMSUR
2011
14 years 6 months ago
2011
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
158
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
175
click to vote
JGT
2006
15 years 6 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
179
click to vote
DM
1998
15 years 6 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...