91 search results - page 3 / 19 » Vertices of given degree in series-parallel graphs |
JGT
2008
13 years 6 months ago
2008
Given a fixed multigraph H with V (H) = {h1, . . . , hm}, we say that a graph G is H-linked if for every choice of m vertices v1, . . . , vm in G, there exists a subdivision of H i...
DM
2008
13 years 6 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
DM
2008
13 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...
IWPEC
2009
Springer
14 years 16 days ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
IPL
2007
13 years 5 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...