6 research outputs found
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
A digraph such that every proper induced subdigraph has a kernel is said to
be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI
for short) resp.) if the digraph has a kernel (does not have a kernel resp.).
The unique CKI-tournament is and the unique
KP-tournaments are the transitive tournaments, however bipartite tournaments
are KP. In this paper we characterize the CKI- and KP-digraphs for the
following families of digraphs: locally in-/out-semicomplete, asymmetric
arc-locally in-/out-semicomplete, asymmetric -quasi-transitive and
asymmetric -anti-quasi-transitive -free and we state that the problem
of determining whether a digraph of one of these families is CKI is polynomial,
giving a solution to a problem closely related to the following conjecture
posted by Bang-Jensen in 1998: the kernel problem is polynomially solvable for
locally in-semicomplete digraphs.Comment: 13 pages and 5 figure
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following
conjecture.
\noindent\textbf{Conjecture}. {\it Let be a 2-strongly connected digraph
of order such that for all distinct pairs of non-adjacent vertices ,
and , , we have . Then is Hamiltonian.}
In this paper, we confirm this conjecture. Moreover, we prove that if a
digraph satisfies the conditions of this conjecture and has a pair of
non-adjacent vertices such that , then
contains cycles of all lengths .Comment: 24 page
Cycle-pancyclism in bipartite tournaments I
Let T be a hamiltonian bipartite tournament with n vertices, γ a hamiltonian directed cycle of T, and k an even number. In this paper, the following question is studied: What is the maximum intersection with γ of a directed cycle of length k? It is proved that for an even k in the range 4 ≤ k ≤ [(n+4)/2], there exists a directed cycle of length h(k), h(k) ∈ {k,k-2} with and the result is best possible. In a forthcoming paper the case of directed cycles of length k, k even and k < [(n+4)/2] will be studied