Poljak and TurzÃk (Discrete Mathematics 1986) introduced the notion of Î»-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0 < Î» < 1 andâ€¦ (More)

Poljak and TurzÃk (Discrete Mathematics 1986) introduced the notion of Î»-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0 < Î» < 1 andâ€¦ (More)

A class domination coloring (also called cd-coloring) of a graph is a proper coloring such that for every color class, there is a vertex that dominates it. The minimum number of colors required for aâ€¦ (More)

The classical Mengerâ€™s theorem states that in any undirected (or directed) graph G, given a pair of vertices s and t, the maximum number of vertex (edge) disjoint paths is equal to the minimum numberâ€¦ (More)

In Closest String problem we are given a set of strings S = {s1, s2, . . . , sk} over an alphabet Î£ such that |si| = n and an integer d. The objective is to check whether there exists a string s overâ€¦ (More)

An undirected graph is said to be split if its vertex set can be partitioned into two sets such that the subgraph induced on one of them is a complete graph and the subgraph induced on the other isâ€¦ (More)

We study some well-known graph contraction problems in the recently introduced framework of lossy kernelization. In classical kernelization, given an instance (I, k) of a parameterized problem, weâ€¦ (More)