6 citations · 15 across the 6 of their papers we have counts for
6 papers
On Complexity of Minimum Leaf Out-branching Problem
Peter Dankelmann, Gregory Gutin, Eun Jung Kim
Given a digraph , the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in an out-branching with the minimum possible number of leaves, i.e., vertices of…
Properly Coloured Cycles and Paths: Results and Open Problems
Gregory Gutin, Eun Jung Kim
In this paper, we consider a number of results and seven conjectures on properly edge-coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results an…
Minimum Leaf Out-branching and Related Problems
G. Gutin, I. Razgon, E. J. Kim
Given a digraph , the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in an out-branching with the minimum possible number of leaves, i.e., vertices of…
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
A. Gupta, G. Gutin, M. Karimi +2
For digraphs and , a homomorphism of to is a mapping $f:\ V(G)\dom V(H)$ such that implies . If, moreover, each vertex is…
Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops
E. J. Kim, G. Gutin
For digraphs and , a mapping $f: V(D)\dom V(H)$ is a homomorphism of to if implies For a fixed digraph , the homomorphism problem…
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments
G. Gutin, E. J. Kim
For digraphs and , a mapping $f: V(D)\dom V(H)$ is a homomorphism of to if implies For a fixed digraph , the homomorphism problem…