Results 21 to 30 of about 446,387 (282)
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-
Zheng Wei, Wideł Wojciech, Wang Ligong
doaj +1 more source
Well-spread sequences and edge-labellings with constant Hamilton-weight [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 A sequence (a_i) of integers is \emphwell-spread if the sums a_i+a_j, for ...
Peter Mark Kayll
doaj +1 more source
Finding Hamilton cycles in random intersection graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj +1 more source
Hamilton cycles in hypergraphs below the Dirac threshold [PDF]
, 2018 We establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in $4$-uniform hypergraphs.
Garbe, Frederik, Mycroft, Richard
core +2 more sources
Sparse Kneser graphs are Hamiltonian [PDF]
, 2020 For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint.
Mütze, Torsten +2 more
core +3 more sources
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.
Alan M. Frieze, Bruce A. Reed
openaire +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"
Zan-Bo Zhang +2 more
openaire +2 more sources
Oriented discrepancy of Hamilton cycles
Journal of Graph Theory, 2023 AbstractWe propose the following extension of Dirac's theorem: if is a graph with vertices and minimum degree , then in every orientation of there is a Hamilton cycle with at least edges oriented in the same direction. We prove an approximate version of this conjecture, showing that minimum degree guarantees a Hamilton cycle with at least edges ...
Lior Gishboliner +2 more
openaire +4 more sources
Difference divisor graph of the finite group [PDF]
International Journal of Research in Industrial Engineering, 2018 Let (Zn, +) be a finite group of integers modulo n and Dn a non-empty subset of Zn containing proper devisors of n. In this paper, we have introduced the difference divisor graph Diff (Zn, Dn) associated with Zn whose vertices coincide with Zn such that ...
R. V M S S Kiran Kumar, T. Chalapathi
doaj +1 more source
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source