91 search results - page 2 / 19 » Vertices of given degree in series-parallel graphs |
JGT
2010
13 years 4 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
COMBINATORICS
1999
13 years 5 months ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...
DISOPT
2011
13 years 22 days ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
CPC
2006
13 years 5 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
JDA
2010
13 years 17 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...