scientific article
From MaRDI portal
Publication:3720644
zbMath0592.05052MaRDI QIDQ3720644
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items
Packing tight Hamilton cycles in 3-uniform hypergraphs, Packing Directed Hamilton Cycles Online, Packing Hamilton Cycles Online, An algorithm for finding Hamilton paths and cycles in random graphs, Unnamed Item, Domination by product measures, Partitioning random graphs into large cycles, Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs, Hitting time for \(k\) edge-disjoint spanning trees in a random graph, A scaling limit for the length of the longest cycle in a sparse random digraph, Successive minimum spanning trees, Packing tree factors in random and pseudo-random graphs, Unnamed Item, Graph and hypergraph packing, Loose Hamilton Cycles in Regular Hypergraphs, Orientability Thresholds for Random Hypergraphs, Hamilton decompositions of regular expanders: applications, On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Almost Eulerian compatible spanning circuits in edge-colored graphs, Packing Arborescences in Random Digraphs, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Optimal covers with Hamilton cycles in random graphs, On two Hamilton cycle problems in random graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Matching theory -- a sampler: From Dénes König to the present, A scaling limit for the length of the longest cycle in a sparse random graph, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, On the robustness of random \(k\)-cores, Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis, The Kőnig graph process, Zero-sum bipartite Ramsey numbers, Note on matching preclusion number of random graphs, Some constructions of $\lambda$-minimal graphs, Analytic description of the phase transition of inhomogeneous multigraphs
