Abstract

The speed and threshold of the biased perfect matching and Hamilton cycle games

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Matching graphs of Hypercubes and Complete Bipartite Graphs
Jiří Fink
Electronic Notes in Discrete Mathematics | VOL. 29
Jiří FinkJiří Fink
01 Aug 2007
Towards Obtaining a 3-Decomposition From a Perfect Matching
Sven O Krumke ... Oliver Bachtler
The Electronic Journal of Combinatorics | VOL. 29
Sven O Krumke, et. al.Sven O Krumke ... Oliver Bachtler
04 Nov 2022
A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes
Wuyang Sun ... Fan Wang
Theoretical Computer Science | VOL. 731
Wuyang Sun, et. al.Wuyang Sun ... Fan Wang
04 Apr 2018
Hamiltonian cycles in n-extendable graphs
...
Journal of Graph Theory | VOL. -
, et. al. ...
01 Jun 2002
View more papers

More From: Discrete Applied Mathematics

Paper Title
Journal
Date
Author
Editorial Board
-
Discrete Applied Mathematics | VOL. 350
--
01 Jun 2024
Characterization of the Jaccard dissimilarity metric and a generalization
Georgios Gerasimou
Discrete Applied Mathematics | VOL. 355
Georgios GerasimouGeorgios Gerasimou
09 May 2024
Gated independence in graphs
Yusuf Civan ... Mehmet Akif Yetim
Discrete Applied Mathematics | VOL. 353
Yusuf Civan, et. al.Yusuf Civan ... Mehmet Akif Yetim
04 May 2024
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]
Markus Ausserhofer ... Géza Tóth
Discrete Applied Mathematics | VOL. -
Markus Ausserhofer, et. al.Markus Ausserhofer ... Géza Tóth
01 May 2024
View more papers