Results 11 to 20 of about 33,816 (262)
Packing Loose Hamilton Cycles [PDF]
Combinatorics, Probability and Computing, 2017 A subsetCof edges in ak-uniform hypergraphHis aloose Hamilton cycleifCcovers all the vertices ofHand there exists a cyclic ordering of these vertices such that the edges inCare segments of that order and such that every two consecutive edges share exactly one vertex.
Ferber, Asaf +3 more
openaire +2 more sources
Extending Cycles Locally to Hamilton Cycles [PDF]
The Electronic Journal of Combinatorics, 2016 A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle $S^1$ that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs.
Hamann, Matthias +2 more
openaire +2 more sources
Identifying Hamilton cycles in the Cartesian product of directed cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj +1 more source
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2013 16 pages, 7 figures, published on "Siam Journal on Discrete Mathematics"
Zhang, Zan-Bo +2 more
openaire +2 more sources
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
The influence of malocclusion, sucking habits and dental caries in the masticatory function of preschool children [PDF]
Brazilian Oral Research, 2020 The aim of this study was to evaluate the association of malocclusion, nutritive and non-nutritive sucking habits and dental caries in the masticatory function of preschool children.
Débora SOUTO-SOUZA +5 more
doaj +1 more source
Saffron for the management of premenstrual dysphoric disorder: A randomized controlled trial
Advanced Biomedical Research, 2020 Background: Selective serotonin reuptake inhibitors are among the most common agents have been used for the treatment of the premenstrual dysphoric disorder (PMDD); however, due to the diversity in the outcomes and adverse effects, efforts are in ...
Fatemeh Rajabi +3 more
doaj +1 more source
Algorithms, 2018 A k-colouring of a graph G with colours 1 , 2 , … , k is canonical with respect to an ordering π = v 1 , v 2 , … , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 ≤ c ≤ k
Ruth Haas, Gary MacGillivray
doaj +1 more source
Discrete Mathematics, 1993 If the complete graph on \(n\) vertices is edge-colored such that the number of times that a color may occur is less than \(cn/\log(n)\), where \(c\) is a fixed constant, then there is a Hamiltonian cycle in which no two edges have the same color.
Frieze, Alan, Reed, Bruce
openaire +1 more source