44
Views
0
CrossRef citations to date
0
Altmetric
Articles

On the existence of (k, l)-kernels in digraphs with a given circumference

, & (Communicated by:)
Pages 15-28 | Received 26 Feb 2011, Accepted 29 Oct 2012, Published online: 10 Mar 2020

References

  • J. Bang-Jensen and G. Gutin, Digraphs, Theory, Algorithms and Applications, Springer-Verlag, (2002).
  • J. Bang-Jensen and G. Gutin, Generalizations of tournaments: A survey, J. Graph Theory, 28 (1998), 171–202.
  • J. Bang-Jensen, J. Huang and E. Prisner, In-tournament digraphs, J. Combin. Theory Ser. B, 59(2) (1993), 267–287.
  • C. Berge, Graphs, North-Holland, Amsterdam, New York (1985).
  • E. Boros and V. Gurvich, Perfect graphs, kernels and cores of cooperative games, Discrete Math., 306 (2006), 2336–2354.
  • D. Bród, A. Włoch and I. Włoch, On the existence of (k, k — 1)-kernels in directed graphs, J. Math. Appi., 28 (2006), 7–12.
  • M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas, The Strong Perfect Graph Theorem, Ann. of Math., 164 (2006), 51–229.
  • R. Diestel, Graph Theory, 3rd Edition, Springer-Verlag, Heidelberg, New York (2005).
  • H. Galeana-Sánchez, On the existence of kernels and h-kernels in directed graphs, Discrete Math., 110 (1992), 251–255.
  • H. Galeana-Sánchez, On the existence of (k, l)-kernels in digraphs, Discrete Math., 85(1) (1990), 99–102.
  • H. Galeana-Sánchez and R. Gómez, (k, l)-kernels, (k, 1)-semikernels, k-Grundy functions and duality for state splittings, Discuss. Math. Graph Theory, 27(2) (2007), 359–371.
  • H. Galeana-Sánchez and C. Hernández-Cruz, k-kernels in generalizations of transitive digraphs, Discuss. Math. Graph Theory, 31(2) (2011), 293–312.
  • H. Galeana-Sánchez and C. Hernández-Cruz, Cyclically k-partite digraphs and k-kernels, Discuss. Math. Graph Theory, 31(1) (2011), 63–79.
  • H. Galeana-Sánchez and C. Hernández-Cruz, k-kernels in multipartite tournaments, AKCE Int. J. Graphs Combin., 8(2) (2011), 181–198.
  • H. Galeana-Sánchez and C. Hernández-Cruz, k-kernels in k-transitive and k-quasitransitive digraphs, Discrete Math., 312(16) (2012), 2522–2530.
  • H. Galeana-Sánchez and X. Li, Semikernels and (k, l)-kernels in Digraphs, SIAM J. Discrete Math, 11(2) (1998), 340–346.
  • M. Kucharska and M. Kwaśnik, On (k, l)-kernels of special superdigraphs of Pm and Cm, Discuss. Math. Graph Theory, 21(1) (2001), 95–109.
  • M. Kwaśnik, On (k, l)-kernels on graphs and their products, Doctoral dissertation, Technical University of Wrocław, Wrocław, (1980).
  • M. Kwaśnik, The Generalizaton of Richardson's Theorem, Discuss. Math. Graph Theory, 4 (1981), 11–14.
  • V. Neumann-Lara, Seminúcleos de una digráfica, Anales del Instituto de Matemáticas II, UNAM, (1971).
  • M. Richardson, On Weakly Ordered Systems, Bull. Amer. Math. Soc., 52 (1946), 113–116.
  • W. Szumny, A. Włoch and I. Włoch, On (k, l)-kernels in D-join of digraphs, Discuss. Math. Graph Theory, 27 (2007), 457–470.
  • W. Szumny, A. Włoch and I. Włoch, On the existence and on the number of (k, l)-kernels in the lexicographic product of graphs, Discuss. Math. Graph Theory, 308(20) (2008), 4616–4624.
  • J. Von Neumann, O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, Princeton (1953).
  • A. Włoch and I. Włoch, On (k, l)-kernels in generalized products, Discrete Math., 164 (1997), 295–301.
  • I. Włoch and A. Włoch, On (k, l)-kernels in the corona of digraphs, Int. J. Pure Appl. Math., 53(4) (2009), 571–582.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.