In a directed graph D on vertex set v_1,… ,v_n, a forward arc
is an arc ...
We introduce a new kernelization tool, called rainbow matching technique...
We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput...
Let D be a k-regular bipartite tournament on n vertices. We show that,
f...
A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that ...
A knot in a directed graph G is a strongly connected subgraph Q of G
wit...
The Wiener index (the distance) of a connected graph is the sum of dista...
Wiener index, defined as the sum of distances between all unordered pair...
Given a tournament T, the problem MaxCT consists of finding a maximum
(a...
For a graph G and an integer-valued threshold function τ on its vertex
s...
A (δ≥ k_1,δ≥ k_2)-partition of a graph G is a
vertex-partition (V_1,V_2)...