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...
A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fe...
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...
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...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
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...
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...