Degree sequences of random graphs
From MaRDI portal
Publication:1146197
DOI10.1016/0012-365X(81)90253-3zbMath0447.05038MaRDI QIDQ1146197
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
05C99: Graph theory
Related Items
Average-case analysis of incremental topological ordering, Expected values of parameters associated with the minimum rank of a graph, Edge-colouring random graphs, Statistical mechanics of complex networks, Extreme degrees in random subgraphs of regular graphs, Some remarks about extreme degrees in a random graph, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- On graphs with equal edge connectivity and minimum degree
- Hamiltonian circuits in random graphs
- On the chromatic index of almost all graphs
- Chromatic number, girth and maximal degree
- Turan's theorem for \(k\)-graphs
- Graph Theory and Probability
- Graph Theory and Probability. II
- On colouring random graphs
- Uniquely Colourable Graphs with Large Girth
- Cliques in random graphs
- Uniquely Partitionable Graphs
- On the probability in the tail of a binomial distribution