Skip to main content
SpringerLink
Log in

Games without repetitions on graphs with vertex disjoint cycles

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

Abstract.

Games without repetitions on graphs with vertex disjoint cycles are considered. We show that the problem finding of the game partition in this class reduces to this problem for trees. A method of finding of the game partition for trees have been given in [2].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Opole, ul. Oleska 48, PL-45-052 Opole, Poland, , , , , , PL

    Z. Dziechcińska-Halamoda, J. Michael & W. Szwiec

Authors
  1. Z. Dziechcińska-Halamoda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Michael
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. Szwiec
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 11.12.1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dziechcińska-Halamoda, Z., Michael, J. & Szwiec, W. Games without repetitions on graphs with vertex disjoint cycles. Arch. Math. 69, 254–258 (1997). https://doi.org/10.1007/s000130050118

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000130050118

Keywords

Search

Navigation