H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
DOI:
https://doi.org/10.11575/cdm.v16i1.62258Abstract
In this paper we prove that if $D$ is a loopless asymmetric 3-quasi-transitive arc-coloured digraph having its arcs coloured with the vertices of a given digraph $H$, and if in $D$ every $C_4$ is an $H$-cycle and every $C_3$ is a quasi-$H$-cycle, then $D$ has an $H$-kernel.
References
\bibitem{A-L} P. Arpin and V. Linek, {\it Reachability problems in edge-coloured digraphs}, Discrete Math. {\bf 307} (2007), 2276-2289.
\bibitem{B-J-G}J. Bang-Jensen, G. Gutin, {\it Digraphs: Theory, Algorithms and Applications}, Springer, London, 2001.
\bibitem{B}C. Berge, {\it Graphs}, North-Holland, Amsterdam, 1985.
\bibitem{B-D}C. Berge and P. Duchet, {\it Recent problems and results about kernels in directed graphs}, Discrete Math. {\bf 86} (1990), 27--31.
\bibitem{L-B1} J. M. Le Bars, {\it Counterexample of the 0-1 law for
fragments of existential second-order logic; an overview}, Bull. Symbolic
Logic, {\bf 9} (2000), 67--82.
\bibitem{L-B2} J. M. Le Bars, {\it The 0-1 law fails for frame
satisfiability of propositional model logic, in:} Proceedings of the 17th
Symposium on Logic in Computer Science, (2002), 225--234.
\bibitem{B-G} E. Boros and V. Gurvich, {\it Perfect graphs, kernels and
cores of cooperative games}, Discrete Math., {\bf 306} (2006),
2336--2354.
\bibitem{D-G} P. Delgado-Escalante and H. Galeana-S\'anchez, {\it Restricted domination in arc-coloured digraphs}.
\bibitem{D3} P. Duchet, Kernels in directed graphs: a poison game, {\it Discrete Math.}, {\bf 115} (1993), 273-276.
\bibitem{F1} A. S. Fraenkel, {\it Combinatorial game theory foundations
applied to digraph kernels}, The Electronic Journal of Combinatorics,
{\bf 4} (1997), 17.
\bibitem{F2} A. S. Fraenkel, {\it Combinatorial games: selected
bibliography with a succinct gourmet introduction}, The Electronic Journal of Combinatorics, {\bf 14} (2007), \#DS2.
\bibitem{H-H-S1} T. W. Haynes, T. Hedetniemi and P. J. Slater, editors, {\it
Domination in Graphs, Advanced Topics}, Marcel Dekker Inc., (1998).
\bibitem{H-H-S2} T. W. Haynes, T. Hedetniemi and P. J. Slater, editors, {\it
Fundamentals of Domination in Graphs}, Marcel Dekker Inc., (1998).
\bibitem{L-S} V. Linek and B. Sands, {\it A note on paths in edge-coloured tournaments}, Ars Combin. {\bf 44} (1996), 225-228.
\end{thebibliography}
Downloads
Published
Issue
Section
License
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.