scientific article; zbMATH DE number 747036
From MaRDI portal
Publication:4697457
zbMATH Open0819.05052MaRDI QIDQ4697457FDOQ4697457
Mark Jerrum, Brendan D. McKay, Alistair Sinclair
Publication date: 27 August 1995
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4198031
- scientific article; zbMATH DE number 1439472
- How likely is an LLD degree sequence to be graphical?
- A remark concerning graphical sequences
- The condition for a sequence to be potentially \(A_{L,M}\)-graphic
- Which line-graphs are perfectly orderable?
- scientific article
- scientific article; zbMATH DE number 7268038
- Sequences of graphical invariants
- Graphic sequences and split graphs
degree sequencelabelled graphsgraphical sequencepolynomial-time probabilistic algorithms\(P\)-stable class
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cited In (12)
- Improving the characterization of P-stability for applications in network privacy
- Approximating degree sequences with regular graphic sequences (extended abstract)
- The mixing time of switch Markov chains: a unified approach
- A sequential algorithm for generating random graphs
- Approximate sampling of graphs with near-\(P\)-stable degree intervals
- Half-graphs, other non-stable degree sequences, and the switch Markov chain
- How likely is an LLD degree sequence to be graphical?
- Matrices with prescribed row and column sums
- Graphic sequences, distances and \(k\)-degree anonymity
- Mixing time of the switch Markov chain and stable degree sequences
- Counting Perfect Matchings and the Switch Chain
- The switch Markov chain for sampling irregular graphs and digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697457)
