Results 21 to 30 of about 445,337 (327)
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
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
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
Hamilton cycles in dense vertex-transitive graphs [PDF]
, 2014 A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large.
Alon +28 more
core +2 more sources
Families of triples with high minimum degree are hamiltonian
Discussiones Mathematicae Graph Theory, 2014 In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj +1 more source
Trends, Cycles and Seasonal Variations of Ukrainian Gross Domestic Product [PDF]
Financial Markets, Institutions and Risks, 2020 The article attempts to study trends, seasonal variations and cyclical fluctuations of Ukraine’s quarterly GDP at current prices. The period of the study is from the first quarter of 2010 to the first quarter of 2020.
Debesh Bhowmik
doaj +1 more source
On prisms, M\"obius ladders and the cycle space of dense graphs [PDF]
, 2011 For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense (i.e.
Abdollahi +56 more
core +1 more source
Matchings and Hamilton cycles in hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +1 more source
Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
Discussiones Mathematicae Graph Theory, 2013 Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2.
Chitra V., Muthusamy A.
doaj +1 more source
Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
Discussiones Mathematicae Graph Theory, 2021 Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G; if there are vertices with degree 3 in G− e, then for each (of the at most two) such vertex x, delete ...
Wu Jichang +3 more
doaj +1 more source