{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:32:43Z","timestamp":1648924363217},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6316,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0012-365x(95)00172-s","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"17-29","source":"Crossref","is-referenced-by-count":1,"title":["Degrees in a digraph whose nodes are graphs"],"prefix":"10.1016","volume":"150","author":[{"given":"Krystyna T.","family":"Bali\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis V.","family":"Quintas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00172-S_BIB1","first-page":"35","article-title":"A kinetic approach to the random f-graph process","volume":"XXIII","author":"Bali\u0144ska","year":"1992"},{"key":"10.1016\/0012-365X(95)00172-S_BIB2","first-page":"349","article-title":"Random graph models for physical systems","volume":"Vol. 51","author":"Balinska","year":"1987"},{"key":"10.1016\/0012-365X(95)00172-S_BIB3","series-title":"Line maximal 2- 3- and 4-graphs","first-page":"323","article-title":"The sequential generation of random f-graphs","volume":"14","author":"Bali\u0144ska","year":"1990"},{"key":"10.1016\/0012-365X(95)00172-S_BIB4","article-title":"The algorithm IMAGE for the random 2-graph process","author":"Bali\u0144ska","year":"1990"},{"key":"10.1016\/0012-365X(95)00172-S_BIB5","series-title":"Proc. of Combinatorics and Algorithms","first-page":"19","article-title":"The sequential generation of random \u0192-graphs. Distributions and predominant types of line maximal \u0192-graphs for \u0192 > 4","volume":"114","author":"Bali\u0144ska","year":"1993"},{"key":"10.1016\/0012-365X(95)00172-S_BIB6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01166922","article-title":"The sequential generation of random edge maximal \u0192-graphs as a function of \u0192","volume":"8","author":"Bali\u0144ska","year":"1991","journal-title":"J. Math. Chem."},{"key":"10.1016\/0012-365X(95)00172-S_BIB7","series-title":"Advances in Graph Theory","first-page":"11","article-title":"Edge maximal graphs with large bounded degree","author":"Bali\u0144ska","year":"1991"},{"key":"10.1016\/0012-365X(95)00172-S_BIB8","series-title":"Proc. of Quo Vadis, Graph Theory?","first-page":"333","article-title":"The random \u0192-graph process","volume":"55","author":"Bali\u0144ska","year":"1992"},{"key":"10.1016\/0012-365X(95)00172-S_BIB9","unstructured":"K.T. Bali\u0144ska and L.V. Quintas, Properties of the transition digraph of the random 2-graph process, Carribean J. Math. Comput. Sci. (in press)."},{"key":"10.1016\/0012-365X(95)00172-S_BIB10","article-title":"The algorithm IMAGE \u0192 for the random \u0192-graph process","author":"Bali\u0144ska","year":"1992"},{"key":"10.1016\/0012-365X(95)00172-S_BIB11","first-page":"28","article-title":"An algorithm concerning the distribution of orexic vertices in the random 2-graph process","volume":"XX","author":"Bali\u0144ska","year":"1991"},{"key":"10.1016\/0012-365X(95)00172-S_BIB12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/jgt.3190030105","article-title":"An intermediate value theorem for graphs with given automorphism group","volume":"3","author":"Hell","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00172-S_BIB13","series-title":"Proc. of Combinatorial Mathematics","first-page":"248","article-title":"Probability models for random \u0192-graphs","volume":"5","author":"Kennedy","year":"1989"},{"key":"10.1016\/0012-365X(95)00172-S_BIB14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0021-9800(67)80018-8","article-title":"Extrema concerning asymmetric graphs","volume":"3","author":"Quintas","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(95)00172-S_BIB15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1017\/S0963548300000183","article-title":"Random graph processes with degree restrictions","volume":"1","author":"Ruci\u0144ski","year":"1992","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/0012-365X(95)00172-S_BIB16","article-title":"The algorithm DOV for the random 2-graph process","author":"Szmanda","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500172S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500172S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:23:31Z","timestamp":1556115811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500172S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X9500172S"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00172-s","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}