One-factor in random graphs based on vertex choice
From MaRDI portal
Cites work
- Hamiltonian circuits in random graphs
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- Matchings in random regular bipartite digraphs
- On factors in random graphs
- On the existence of a factor of degree one of a connected random graph
- On the Expected Value of a Random Assignment Problem
- On the strength of connectedness of a random graph
- The Factorization of Linear Graphs
Cited in
(7)- How many random edges make a graph Hamiltonian?
- Random near-regular graphs and the node packing problem
- Maximum matchings in a class of random graphs
- On factors in random graphs
- A threshold for perfect matchings in random d-pure hypergraphs
- On random k-out subgraphs of large graphs
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: One-factor in random graphs based on vertex choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1169488)