Zobrazeno 1 - 10
of 30 593
pro vyhledávání: '"Gutin, A."'
Autor:
Li, Ruonan, Ning, Bo
A path (cycle) is properly-colored if consecutive edges are of distinct colors. In 1997, Bang-Jensen and Gutin conjectured a necessary and sufficient condition for the existence of a Hamilton path in an edge-colored complete graph. This conjecture, c
Externí odkaz:
http://arxiv.org/abs/2207.03793
An oriented multigraph is a directed multigraph without directed 2-cycles. Let ${\rm fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph $D$. The degree of a vertex is the sum of its out- and in-degrees. In several papers
Externí odkaz:
http://arxiv.org/abs/2409.07680
A run of the deferred acceptance (DA) algorithm may contain proposals that are sure to be rejected. We introduce the accelerated deferred acceptance algorithm that proceeds in a similar manner to DA but with sure-to-be rejected proposals ruled out. A
Externí odkaz:
http://arxiv.org/abs/2409.06865
Autor:
Darbinyan, S.Kh., Karapetyan, I.A.
Publikováno v:
In Discrete Applied Mathematics 10 January 2017 216 Part 3:537-549
An oriented graph $D$ is converse invariant if, for any tournament $T$, the number of copies of $D$ in $T$ is equal to that of its converse $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684-701] showed that any oriented graph $D$ with
Externí odkaz:
http://arxiv.org/abs/2407.17051
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Darbinyan, S. Kh., Karapetyan, I. A.
Let $D$ be a strong digraph on $n\geq 4$ vertices. In [2, J. Graph Theory 22 (2) (1996) 181-187)], J. Bang-Jensen, G. Gutin and H. Li proved the following theorems: If (*) $d(x)+d(y)\geq 2n-1$ and $min \{d(x), d(y)\}\geq n-1$ for every pair of non-ad
Externí odkaz:
http://arxiv.org/abs/1207.5643
Let $G=(V, E)$ be a graph and let each vertex of $G$ has a lamp and a button. Each button can be of $\sigma^+$-type or $\sigma$-type. Assume that initially some lamps are on and others are off. The button on vertex $x$ is of $\sigma^+$-type ($\sigma$
Externí odkaz:
http://arxiv.org/abs/2404.16540
An oriented graph is called $k$-anti-traceable if the subdigraph induced by every subset with $k$ vertices has a hamiltonian anti-directed path. In this paper, we consider an anti-traceability conjecture. In particular, we confirm this conjecture hol
Externí odkaz:
http://arxiv.org/abs/2403.19312
Role mining is a technique used to derive a role-based authorization policy from an existing policy. Given a set of users $U$, a set of permissions $P$ and a user-permission authorization relation $\mahtit{UPA}\subseteq U\times P$, a role mining algo
Externí odkaz:
http://arxiv.org/abs/2403.16757