Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Sierksma, Gerard
and
Hoogeveen, Han
1991.
Seven criteria for integer sequences being graphic.
Journal of Graph Theory,
Vol. 15,
Issue. 2,
p.
223.
Arratia, Richard
and
Liggett, Thomas M.
2005.
How likely is an i.i.d. degree sequence to be graphical?.
The Annals of Applied Probability,
Vol. 15,
Issue. 1B,
Lin, Chiang
and
Ou, Wei-Bo
2007.
A note on degree-continuous graphs.
Czechoslovak Mathematical Journal,
Vol. 57,
Issue. 3,
p.
1043.
Tripathi, Amitabha
and
Tyagi, Himanshu
2008.
A simple criterion on degree sequences of graphs.
Discrete Applied Mathematics,
Vol. 156,
Issue. 18,
p.
3513.
Tripathi, Amitabha
Venugopalan, Sushmita
and
West, Douglas B.
2010.
A short constructive proof of the Erdős–Gallai characterization of graphic lists.
Discrete Mathematics,
Vol. 310,
Issue. 4,
p.
843.
Wang, Tian
and
Krim, Hamid
2012.
Statistical classification of social networks.
p.
3977.
Yin, Jian-Hua
2012.
A short constructive proof of A.R. Rao’s characterization of potentially Kr+1-graphic sequences.
Discrete Applied Mathematics,
Vol. 160,
Issue. 3,
p.
352.
Kreutzer, Stephan
and
Schweikardt, Nicole
2014.
On Hanf-equivalence and the number of embeddings of small induced subgraphs.
p.
1.
Morris, James F.
O’Neal, Jerome W.
and
Deckro, Richard F.
2014.
A random graph generation algorithm for the analysis of social networks.
The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology,
Vol. 11,
Issue. 3,
p.
265.
Bar-Noy, Amotz
Choudhary, Keerti
Peleg, David
and
Rawitz, Dror
2018.
Structural Information and Communication Complexity.
Vol. 11085,
Issue. ,
p.
3.
Tishby, Ido
Biham, Ofer
Kühn, Reimer
and
Katzav, Eytan
2018.
Statistical analysis of articulation points in configuration model networks.
Physical Review E,
Vol. 98,
Issue. 6,
Tishby, Ido
Biham, Ofer
Katzav, Eytan
and
Kühn, Reimer
2018.
Revealing the microstructure of the giant component in random graph ensembles.
Physical Review E,
Vol. 97,
Issue. 4,
Klickstein, Isaac
and
Sorrentino, Francesco
2019.
Generating Graphs with Symmetry.
IEEE Transactions on Network Science and Engineering,
Vol. 6,
Issue. 4,
p.
836.
Tishby, Ido
Biham, Ofer
Katzav, Eytan
and
Kühn, Reimer
2019.
Generating random networks that consist of a single connected component with a given degree distribution.
Physical Review E,
Vol. 99,
Issue. 4,
Bar-Noy, Amotz
Choudhary, Keerti
Peleg, David
and
Rawitz, Dror
2019.
WALCOM: Algorithms and Computation.
Vol. 11355,
Issue. ,
p.
3.
Dvořák, Pavel
Feldmann, Andreas Emil
Rai, Ashutosh
and
Rzążewski, Paweł
2020.
Graph-Theoretic Concepts in Computer Science.
Vol. 12301,
Issue. ,
p.
40.
Bar-Noy, Amotz
Peleg, David
and
Rawitz, Dror
2020.
Vertex-weighted realizations of graphs.
Theoretical Computer Science,
Vol. 807,
Issue. ,
p.
56.
Bonneau, Haggai
Biham, Ofer
Kühn, Reimer
and
Katzav, Eytan
2020.
Statistical analysis of edges and bredges in configuration model networks.
Physical Review E,
Vol. 102,
Issue. 1,
Pereira, Luis Ramada
Lopes, Rui J
Louçã, Jorge
and
Mendes, Jose
2020.
Syntgen: a system to generate temporal networks with user-specified topology.
Journal of Complex Networks,
Vol. 8,
Issue. 4,
Van Koevering, Katherine
Benson, Austin
and
Kleinberg, Jon
2021.
Random Graphs with Prescribed K-Core Sequences: A New Null Model for Network Analysis.
p.
367.