Packing, counting and covering Hamilton cycles in random directed graphs

Packing, counting and covering Hamilton cycles in random directed graphs

A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this is that there is no general tool f...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Ferber, A, Kronenberg, G, Long, E
Formáid:	Journal article
Foilsithe / Cruthaithe:	Springer Verlag 2017

Míreanna comhchosúla

Packing and counting arbitrary Hamilton cycles in random digraphs
de réir: Ferber, A, et al.
Foilsithe / Cruthaithe: (2018)

Counting Hamilton decompositions of oriented graphs
de réir: Ferber, A, et al.
Foilsithe / Cruthaithe: (2017)

Finding Hamilton cycles in random intersection graphs
de réir: Katarzyna Rybarczyk
Foilsithe / Cruthaithe: (2018-03-01)

Packing trees of unbounded degrees in random graphs
de réir: Ferber, Asaf, et al.
Foilsithe / Cruthaithe: (2022)

Edge Disjoint Hamilton Cycles in Knödel Graphs
de réir: Palanivel Subramania Nadar Paulraja, et al.
Foilsithe / Cruthaithe: (2016-07-01)

Hamilton Cycles in Double Generalized Petersen Graphs
de réir: Sakamoto Yutaro
Foilsithe / Cruthaithe: (2019-02-01)

Hamilton cycles in almost distance-hereditary graphs
de réir: Chen Bing, et al.
Foilsithe / Cruthaithe: (2016-01-01)

On hamiltonicity of uniform random intersection graphs
de réir: Mindaugas Bloznelis, et al.
Foilsithe / Cruthaithe: (2010-12-01)

A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
de réir: Tang Long, et al.
Foilsithe / Cruthaithe: (2020-02-01)

Identifying Hamilton cycles in the Cartesian product of directed cycles
de réir: Zbigniew R. Bogdanowicz
Foilsithe / Cruthaithe: (2020-01-01)

A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
de réir: A. N.M. Salman, et al.
Foilsithe / Cruthaithe: (2013-12-01)

An exact minimum degree condition for Hamilton cycles in oriented graphs
de réir: Keevash, P, et al.
Foilsithe / Cruthaithe: (2008)

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
de réir: Kühn, D, et al.
Foilsithe / Cruthaithe: (2015)

Hamiltonicity in Directed Toeplitz Graphs with s1=1 and s3=4
de réir: Shabnam Malik
Foilsithe / Cruthaithe: (2023-01-01)

Packing random graphs and hypergraphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2016)

Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
de réir: Suliman Khan, et al.
Foilsithe / Cruthaithe: (2021-02-01)

On maximum cycle packings in polyhedral graphs
de réir: Peter Recht, et al.
Foilsithe / Cruthaithe: (2014-04-01)

On the Packing Partitioning Problem on Directed Graphs
de réir: Babak Samadi, et al.
Foilsithe / Cruthaithe: (2021-12-01)

Energy Conditions for Hamiltonicity of Graphs
de réir: Guidong Yu, et al.
Foilsithe / Cruthaithe: (2014-01-01)

Hamilton-Connected Mycielski Graphs∗
de réir: Yuanyuan Shen, et al.
Foilsithe / Cruthaithe: (2021-01-01)

Spectral Radius and Hamiltonicity of Graphs
de réir: Yu Guidong, et al.
Foilsithe / Cruthaithe: (2019-11-01)

The matching number and Hamiltonicity of graphs
de réir: Rao Li
Foilsithe / Cruthaithe: (2020-09-01)

Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
de réir: Wu Jichang, et al.
Foilsithe / Cruthaithe: (2021-05-01)

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
de réir: Mou, G, et al.
Foilsithe / Cruthaithe: (2016)

Matchings and Hamilton cycles in hypergraphs
de réir: Daniela Kühn, et al.
Foilsithe / Cruthaithe: (2005-01-01)

The packing and covering of the complete graph I: the forests of order five
de réir: Y. Roditty
Foilsithe / Cruthaithe: (1986-01-01)

Approximate cycles count in undirected graphs
de réir: Maytham Safar, et al.
Foilsithe / Cruthaithe: (2014-04-01)

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
de réir: Mou, Gao, et al.
Foilsithe / Cruthaithe: (2017)

Signless Laplacian Spectral Conditions for Hamiltonicity of Graphs
de réir: Guidong Yu, et al.
Foilsithe / Cruthaithe: (2014-01-01)

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
de réir: Zheng Wei, et al.
Foilsithe / Cruthaithe: (2022-02-01)

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
de réir: Li Binlong, et al.
Foilsithe / Cruthaithe: (2016-11-01)

Hamiltonicity and Generalised Total Colourings of Planar Graphs
de réir: Borowiecki Mieczysław, et al.
Foilsithe / Cruthaithe: (2016-05-01)

On hamiltonicity of 1-tough triangle-free graphs
de réir: Wei Zheng, et al.
Foilsithe / Cruthaithe: (2021-10-01)

Some sufficient conditions on hamilton graphs with toughness
de réir: Gaixiang Cai, et al.
Foilsithe / Cruthaithe: (2022-10-01)

Edge condition for hamiltonicity in balanced tripartite graphs
de réir: Janusz Adamus
Foilsithe / Cruthaithe: (2009-01-01)

Two Sufficient Conditions for Hamilton and Dominating Cycles
de réir: Zh. G. Nikoghosyan
Foilsithe / Cruthaithe: (2012-01-01)

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs
de réir: Ruth Haas, et al.
Foilsithe / Cruthaithe: (2018-03-01)

Packing and covering the balanced complete bipartite multigraph with cycles and stars
de réir: Hung-Chih Lee
Foilsithe / Cruthaithe: (2014-09-01)

Packing 1-plane Hamiltonian cycles in complete geometric graphs
de réir: Trao, Hazim Michman, et al.
Foilsithe / Cruthaithe: (2019)

Maximum Cycle Packing in Eulerian Graphs Using Local Traces
de réir: Recht Peter, et al.
Foilsithe / Cruthaithe: (2015-02-01)