Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Grzegorz Gancarzewicz"'
Publikováno v:
Opuscula Mathematica, Vol 29, Iss 4, Pp 345-364 (2009)
Let \(G=(X,Y,E)\) be a balanced \(2\)-connected bipartite graph and \(S \subset V(G)\). We will say that \(S\) is cyclable in \(G\) if all vertices of \(S\) belong to a common cycle in \(G\). We give sufficient degree conditions in a balanced biparti
Externí odkaz:
https://doaj.org/article/8cd87dc03ea14ab290190bd4c77d5d58
Publikováno v:
Discrete Mathematics. 307:1525-1537
We give sufficient Ore-type conditions for a balanced bipartite graph to contain every matching in a hamiltonian cycle or a cycle not necessarily hamiltonian. Moreover, for the hamiltonian case we prove that the condition is almost best possible.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d19f6031597b1336ae851367ed748be1
https://doi.org/10.1016/j.disc.2005.11.090
https://doi.org/10.1016/j.disc.2005.11.090
Publikováno v:
Electronic Notes in Discrete Mathematics. 22:543-547
We give sufficient degree-sum conditions for a graph to contain every matching in a hamiltonian cycle or a hamiltonian path. Moreover we prove that some results are almost best possible.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aae85812e280aa7e5536a39a80391062
https://doi.org/10.1016/j.endm.2005.06.085
https://doi.org/10.1016/j.endm.2005.06.085
Publikováno v:
Discrete Mathematics. (11):3703-3713
We give a degree sum condition for three independent vertices under which every matching of a graph lies in a hamiltonian cycle. We also show that the bound for the degree sum is almost the best possible.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a75b3473c3db1cf395561736de1a5b2