Results 31 to 40 of about 3,218,251 (319)
Notes on Hamiltonian threshold and chain graphs
AIMS Mathematics, 2021 We revisit results obtained in [1], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained.
Milica Anđelić +2 more
doaj +1 more source
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2020 We investigate the emergence of subgraphs in sparse pseudo‐random k‐uniform hypergraphs, using the following comparatively weak notion of pseudo‐randomness.
Hiêp Hàn, Jie Han, Patrick Morris
semanticscholar +1 more source
On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph [PDF]
Electronic Journal of Combinatorics, 2020 We consider Hamilton cycles in the random digraph $D_{n,m}$ where the orientation of edges follows a pattern other than the trivial orientation in which the edges are oriented in the same direction as we traverse the cycle.
A. Frieze +2 more
semanticscholar +1 more source
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs [PDF]
Electronic Journal of Combinatorics, 2020 We consider a robust variant of Dirac-type problems in $k$-uniform hypergraphs. For instance, we prove that if $\mathcal{H}$ is a $k$-uniform hypergraph with minimum codegree at least $\left(\frac 12 + \gamma \right)n$, $\gamma >0$, and $n$ is ...
Sylwia Antoniuk +2 more
semanticscholar +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
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
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