scientific article; zbMATH DE number 747036

MaRDI QIDQ4697457zbMATH OpenFDO

Authors Alistair Sinclair, Brendan D. McKay, Mark Jerrum

Publication date 27 August 1995

zbMATH Keywords

degree sequencelabelled graphsgraphical sequencepolynomial-time probabilistic algorithms\(P\)-stable class

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph theory (05C99)

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; zbMATH DE number 5734066
• scientific article; zbMATH DE number 7268038
• Sequences of graphical invariants
• Graphic sequences and split graphs

Cited in

(13)

• Counting perfect matchings and the switch chain
• 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
• Half-graphs, other non-stable degree sequences, and the switch Markov chain
• Approximate sampling of graphs with near-P-stable degree intervals
• 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
• Fully graphic degree sequences and P-stable degree sequences
• 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)