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...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Ferber, A, Kronenberg, G, Long, E
Format:	Journal article
Udgivet:	Springer Verlag 2017

Lignende værker

Packing and counting arbitrary Hamilton cycles in random digraphs
af: Ferber, A, et al.
Udgivet: (2018)

Counting Hamilton decompositions of oriented graphs
af: Ferber, A, et al.
Udgivet: (2017)

Finding Hamilton cycles in random intersection graphs
af: Katarzyna Rybarczyk
Udgivet: (2018-03-01)

Packing trees of unbounded degrees in random graphs
af: Ferber, Asaf, et al.
Udgivet: (2022)

Edge Disjoint Hamilton Cycles in Knödel Graphs
af: Palanivel Subramania Nadar Paulraja, et al.
Udgivet: (2016-07-01)

Hamilton Cycles in Double Generalized Petersen Graphs
af: Sakamoto Yutaro
Udgivet: (2019-02-01)

Hamilton cycles in almost distance-hereditary graphs
af: Chen Bing, et al.
Udgivet: (2016-01-01)

On hamiltonicity of uniform random intersection graphs
af: Mindaugas Bloznelis, et al.
Udgivet: (2010-12-01)

A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
af: Tang Long, et al.
Udgivet: (2020-02-01)

Identifying Hamilton cycles in the Cartesian product of directed cycles
af: Zbigniew R. Bogdanowicz
Udgivet: (2020-01-01)

A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
af: A. N.M. Salman, et al.
Udgivet: (2013-12-01)

An exact minimum degree condition for Hamilton cycles in oriented graphs
af: Keevash, P, et al.
Udgivet: (2008)

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
af: Kühn, D, et al.
Udgivet: (2015)

Hamiltonicity in Directed Toeplitz Graphs with s1=1 and s3=4
af: Shabnam Malik
Udgivet: (2023-01-01)

Packing random graphs and hypergraphs
af: Bollobas, B, et al.
Udgivet: (2016)

Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
af: Suliman Khan, et al.
Udgivet: (2021-02-01)

On maximum cycle packings in polyhedral graphs
af: Peter Recht, et al.
Udgivet: (2014-04-01)

On the Packing Partitioning Problem on Directed Graphs
af: Babak Samadi, et al.
Udgivet: (2021-12-01)

Energy Conditions for Hamiltonicity of Graphs
af: Guidong Yu, et al.
Udgivet: (2014-01-01)

Hamilton-Connected Mycielski Graphs∗
af: Yuanyuan Shen, et al.
Udgivet: (2021-01-01)

Spectral Radius and Hamiltonicity of Graphs
af: Yu Guidong, et al.
Udgivet: (2019-11-01)

The matching number and Hamiltonicity of graphs
af: Rao Li
Udgivet: (2020-09-01)

Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
af: Wu Jichang, et al.
Udgivet: (2021-05-01)

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
af: Mou, G, et al.
Udgivet: (2016)

Matchings and Hamilton cycles in hypergraphs
af: Daniela Kühn, et al.
Udgivet: (2005-01-01)

The packing and covering of the complete graph I: the forests of order five
af: Y. Roditty
Udgivet: (1986-01-01)

Approximate cycles count in undirected graphs
af: Maytham Safar, et al.
Udgivet: (2014-04-01)

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
af: Mou, Gao, et al.
Udgivet: (2017)

Signless Laplacian Spectral Conditions for Hamiltonicity of Graphs
af: Guidong Yu, et al.
Udgivet: (2014-01-01)

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
af: Zheng Wei, et al.
Udgivet: (2022-02-01)

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
af: Li Binlong, et al.
Udgivet: (2016-11-01)

Hamiltonicity and Generalised Total Colourings of Planar Graphs
af: Borowiecki Mieczysław, et al.
Udgivet: (2016-05-01)

On hamiltonicity of 1-tough triangle-free graphs
af: Wei Zheng, et al.
Udgivet: (2021-10-01)

Some sufficient conditions on hamilton graphs with toughness
af: Gaixiang Cai, et al.
Udgivet: (2022-10-01)

Edge condition for hamiltonicity in balanced tripartite graphs
af: Janusz Adamus
Udgivet: (2009-01-01)

Two Sufficient Conditions for Hamilton and Dominating Cycles
af: Zh. G. Nikoghosyan
Udgivet: (2012-01-01)

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs
af: Ruth Haas, et al.
Udgivet: (2018-03-01)

Packing and covering the balanced complete bipartite multigraph with cycles and stars
af: Hung-Chih Lee
Udgivet: (2014-09-01)

Packing 1-plane Hamiltonian cycles in complete geometric graphs
af: Trao, Hazim Michman, et al.
Udgivet: (2019)

Maximum Cycle Packing in Eulerian Graphs Using Local Traces
af: Recht Peter, et al.
Udgivet: (2015-02-01)