6533b82cfe1ef96bd128fe27

RESEARCH PRODUCT

Games without repetitions on graphs with vertex disjoint cycles

Jerzy MichaelZ. Dziechcińska-halamodaW. Szwiec

subject

CombinatoricsVertex (graph theory)Discrete mathematicsComputer Science::Computer Science and Game TheoryGeneral MathematicsProblem findingComputingMilieux_PERSONALCOMPUTINGPartition (number theory)Disjoint setsMathematicsofComputing_DISCRETEMATHEMATICSMathematics

description

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].

yearjournalcountryeditionlanguage
1997-09-01Archiv der Mathematik
https://doi.org/10.1007/s000130050118