Results 51 to 60 of about 4,036,327 (265)
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
Hamilton-connected properties in cartesian product [PDF]
Transactions on Combinatorics, 2012 In this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. We present some sufficient and necessary conditions for $GBox H$ being hamilton-connected when $G$ is a hamilton-connected ...
Rushengul Hoshur, Elkin Vumar
doaj
Rainbow Hamilton Cycles in Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 Let $K_n^{(k)}$ be the complete $k$-uniform hypergraph, $k\ge3$, and let $\ell$ be an integer such that $1\le \ell\le k-1$ and $k-\ell$ divides $n$. An $\ell$-overlapping Hamilton cycle in $K_n^{(k)}$ is a spanning subhypergraph $C$ of $K_n^{(k)}$ with $n/(k-\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists
Dudek, Andrzej +2 more
openaire +2 more sources
Edge condition for hamiltonicity in balanced tripartite graphs [PDF]
Opuscula Mathematica, 2009 A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order \(2n\) obtained from the complete balanced bipartite \(K_{n,n}\) by removing at most \(n-2\) edges, is bipancyclic.
Janusz Adamus
doaj +1 more source
Perfect Set of Euler Tours of Kp,p,p
Discussiones Mathematicae Graph Theory, 2016 Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Hamilton cycle decomposable. In this paper, we construct a perfect set of Euler tours for the complete tripartite graph Kp,p,p for any prime p and hence ...
Govindan T., Muthusamy A.
doaj +1 more source
Colorful Hamilton Cycles in Random Graphs
SIAM Journal on Discrete Mathematics, 2023 fixed minor ...
Debsoumya Chakraborti +2 more
openaire +3 more sources
On Hamilton decompositions of infinite circulant graphs [PDF]
, 2017 The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected 2k-valent infinite circulant graph has a two-way-infinite Hamilton path ...
Bryant, Darryn +3 more
core +2 more sources
Rainbow hamilton cycles in random graphs [PDF]
Random Structures & Algorithms, 2013 AbstractOne of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdős‐Rényi random graph Gn,p is around . Much research has been done to extend this to increasingly challenging random structures.
Frieze, Alan, Loh, Po-Shen
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
Electronic Journal of Graph Theory and Applications, 2021 A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj +1 more source