{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:16:40Z","timestamp":1781345800160,"version":"3.54.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0012-365x(94)00104-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"3-20","source":"Crossref","is-referenced-by-count":37,"title":["Realizability and uniqueness in graphs"],"prefix":"10.1016","volume":"136","author":[{"given":"Martin","family":"Aigner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eberhard","family":"Triesch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00104-Q_BIB1","first-page":"61","article-title":"Uses of the diagram lattice","volume":"163","author":"Aigner","year":"1984","journal-title":"Mitteil. Mathem. Sem. Giessen"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(86)90026-0","article-title":"Search problems on graphs","volume":"14","author":"Aigner","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB3","author":"Aigner","year":"1988"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0963548300000535","article-title":"Reconstructing a graph from its neighborhood list","volume":"2","author":"Aigner","year":"1993","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(93)90473-7","article-title":"Edge search in graphs and hypergraphs of bounded rank","volume":"115","author":"Alth\u00f6fer","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(91)90003-K","article-title":"A search problem on graphs which generalizes some group testing problems with two detectives","volume":"88","author":"Andreae","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB7","first-page":"220","article-title":"A graph reconstructor's manual","volume":"166","author":"Bondy","year":"1991"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0602005","article-title":"A group testing problem on two disjoint sets","volume":"2","author":"Chang","year":"1981","journal-title":"SIAM J. Alg. Discrete Meth."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(82)90067-1","article-title":"Group testing with two detectives","volume":"4","author":"Chang","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB10","doi-asserted-by":"crossref","unstructured":"P. Damaschke, A tight upper bound for group testing in graphs, Discrete Math., to appear.","DOI":"10.1016\/0166-218X(92)00120-B"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB11","first-page":"385","article-title":"Graphic sequences and graphic polynomials: a report","volume":"10","author":"Eggleton","year":"1975"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB12","first-page":"264","article-title":"Graphen mit Punkten vorgeschriebenen Grades","volume":"11","author":"Erd\u00f6s","year":"1960","journal-title":"Math. Lapok"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB13","first-page":"439","article-title":"Graphs realizing the same degree sequences and their respective clique numbers","author":"Erd\u00f6s","year":"1991"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.3190150107","article-title":"On the residue of a graph","volume":"15","author":"Favaron","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB15","doi-asserted-by":"crossref","first-page":"831","DOI":"10.2140\/pjm.1960.10.831","article-title":"Zero-one matrices with zero trace","volume":"10","author":"Fulkerson","year":"1960","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.4153\/CJM-1962-041-9","article-title":"Multiplicities and minimal widths for (0,1)-matrices","volume":"11","author":"Fulkerson","year":"1962","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB17","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","article-title":"A theorem on flows in networks","volume":"7","author":"Gale","year":"1957","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB18","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB19","first-page":"496","article-title":"On the realizability of a set of integers as degrees of the vertices of a linear graph","volume":"10","author":"Hakimi","year":"1962","journal-title":"J. SIAM"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0602006","article-title":"Threshold sequences","volume":"2","author":"Hammer","year":"1981","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB21","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","article-title":"Eine Bemerkung \u00fcber die Existenz der endlichen Graphen","volume":"80","author":"Havel","year":"1955","journal-title":"Casopis Pest Mat."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB22","unstructured":"L.A. Hemachandra and D. Kratsch, On the complexity of graph reconstruction, Math. System Theory, to appear."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB23","first-page":"401","article-title":"Graph isomorphism is low for PP","volume":"577","author":"K\u00f6bler","year":"1992"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02476378","article-title":"On dominance relations and the structure of animal societies III; the condition for a score structure","volume":"15","author":"Landau","year":"1955","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB25","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0210002","article-title":"Some NP-complete problems similar to graph isomorphism","volume":"10","author":"Lubiw","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB26","unstructured":"N. M\u00fcller and E. Triesch, Bipartite planar graphs are optimal, in preparation."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB27","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0024-3795(89)90470-9","article-title":"The polytope of degree sequences","volume":"114","author":"Peled","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB28","first-page":"251","article-title":"The clique number of a graph with a given degree sequence","volume":"4","author":"Rao","year":"1979"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB29","first-page":"285","article-title":"The branching extent of graphs","volume":"4","author":"Ruch","year":"1979","journal-title":"J. Combin Information System Sci."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB30","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","article-title":"Combinatorial properties of matrices of zeros and ones","volume":"9","author":"Ryser","year":"1957","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(94)00104-Q_BIB31","first-page":"1214","article-title":"Problem","volume":"18","author":"S\u00f3s","year":"1978"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB32","author":"Triesch","year":"1993"},{"key":"10.1016\/0012-365X(94)00104-Q_BIB33","doi-asserted-by":"crossref","unstructured":"E. Triesch, Degree sequences of graphs and dominance order, J. Graph Theory, to appear.","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<89::AID-JGT12>3.0.CO;2-J"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400104Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400104Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:15:22Z","timestamp":1621030522000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400104Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0012365X9400104Q"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00104-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}