On the connectivity of random m-orientable graphs and digraphs

DOI10.1007/BF02579431zbMATH Open0523.05056DBLPjournals/combinatorica/FennerF82OpenAlexW1577466578WikidataQ57401644 ScholiaQ57401644MaRDI QIDQ1056764FDOQ1056764

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
On the strength of connectedness of a random graph
On the existence of Hamiltonian cycles in a class of random graphs
On the Expected Value of a Random Assignment Problem
The Expected Number of Components Under a Random Mapping Function
Probability of Indecomposability of a Random Mapping Function

Cited In (28)

Maximum matchings in a class of random graphs
Matchings and cycle covers in random digraphs
Hamiltonian Berge cycles in random hypergraphs
Maximal paths in random dynamic graphs
On the largest strong components in \(m\)-out digraphs
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
Understanding Policy Diffusion in the U.S.: An Information-Theoretical Approach to Unveil Connectivity Structures in Slowly Evolving Complex Systems
Hamilton cycles in 3-out
An accurate, scalable and verifiable protocol for federated differentially private averaging
On the equational graphs over finite fields
On the value of a random minimum spanning tree problem
The strong giant in a random digraph
Random near-regular graphs and the node packing problem
On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
On the existence of Hamiltonian cycles in a class of random graphs
Practical provably secure flooding for blockchains
Edge disjoint spanning trees in random graphs
A new random graph model with self-optimizing nodes: connectivity and diameter
On the 2‐cyclic property in 2‐regular digraphs
On random \(k\)-out subgraphs of large graphs
The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected
Diameter and stationary distribution of random \(r\)-out digraphs
Title not available (Why is that?)
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs
Connectivity threshold of Bluetooth graphs
Connectivity of the k-Out Hypercube
Finding Hamilton cycles in sparse random graphs

This page was built for publication: On the connectivity of random m-orientable graphs and digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1056764)