{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T10:10:09Z","timestamp":1744279809357},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0166-218x(02)00593-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:45:30Z","timestamp":1056977130000},"page":"329-343","source":"Crossref","is-referenced-by-count":1,"title":["Generating r-regular graphs"],"prefix":"10.1016","volume":"129","author":[{"given":"Guoli","family":"Ding","sequence":"first","affiliation":[]},{"given":"Peter","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00593-0_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(74)90035-1","article-title":"On generating planar graphs","volume":"7","author":"Barnette","year":"1974","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"10.1016\/S0166-218X(02)00593-0_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02759790","article-title":"Generating the c*5-connected graphs","volume":"28","author":"Barnette","year":"1977","journal-title":"Israel Journal of Mathematics"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB3","doi-asserted-by":"crossref","unstructured":"D.W. Barnette, B. Grunbaum, On Steinitz\u2019s theorem concerning convex 3-polytopes and some properties of planar graphs, in: The many facets of graph theory, Lecture Notes in Mathematics, Vol. 110, Springer, Berlin, 1969, pp. 27\u201340.","DOI":"10.1007\/BFb0060102"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB4","doi-asserted-by":"crossref","unstructured":"F. Bories, J.-L. Jolivet, J.-L. Fouquet, Construction of 4-regular graphs, Combinatorial Mathematics, 1981, 99\u2013118; North-Holland Math. Stud., Vol. 75, North-Holland, Amsterdam, 1983.","DOI":"10.1016\/S0304-0208(08)73378-4"},{"issue":"5","key":"10.1016\/S0166-218X(02)00593-0_BIB5","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1002\/jgt.3190170508","article-title":"Generating all 3-connected 4-regular planar graphs from the octahedron graph","volume":"17","author":"Broersma","year":"1993","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/S0166-218X(02)00593-0_BIB6","doi-asserted-by":"crossref","first-page":"686","DOI":"10.4153\/CJM-1974-065-6","article-title":"A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs","volume":"XXVI","author":"Butler","year":"1974","journal-title":"Can. J. Math."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB7","first-page":"251","article-title":"Regulare Graphen gegebener Tailenweite mit minimaler Knotenzahl","volume":"12","author":"Erdos","year":"1963","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math. -Natur. Reihe"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB8","unstructured":"G.B. Faulkner, D.H. Younger, The recursive generation of cyclically k-connected cubic planar maps, Proceedings of the Twenty-Fifth Summer Meeting of the Canadian Mathematical Congress, Thunder Bay, 1971, pp. 349\u2013356."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB9","unstructured":"M. Fontet, Connectivite des graphs et automorphismes des cartes: proprietes et algorithmes, These d'Etat, Universite P. et M. Curie, Paris, 1979."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB10","doi-asserted-by":"crossref","unstructured":"E.L. Johnson, A proof of the four-coloring of the edges of a regular three-degree graph, O.R.C.63-28 (R.R) mimeographed report, Operations Research Center, University of California, 1963.","DOI":"10.21236\/AD0426484"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB11","unstructured":"A.K. Kelmans, Graph expansion and reduction, in: Algebraic methods in graph theory, Vol. 1, Colloq. Math. Soc. Janos Bolyai (Szeged, Hungary, 1978), North Holland 25 (1981) 318\u2013343."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB12","first-page":"1","article-title":"Regularly connected trivalent graphs without non-trivial cuts of cardinality 3","volume":"21","author":"Kotzig","year":"1969","journal-title":"Acta. Fac. Rerum Natur. Univ. Comenian Math. Publ."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1002\/jgt.3190050412","article-title":"Generating all 4-regular planar graphs from the graph of the octahedron","volume":"5","author":"Lehel","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/jgt.3190030406","article-title":"Generating all planar graphs regular of degree four","volume":"3","author":"Manca","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB15","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/0095-8956(92)90004-H","article-title":"Edge-reductions in cyclically k-connected cubic graphs","volume":"56","author":"McCuaig","year":"1992","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB16","first-page":"136","article-title":"Irreducible quadrangulations of the Klein bottle","volume":"43","author":"Nakamonto","year":"1995","journal-title":"Yolohama Math. J."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jctb.1996.0040","article-title":"Irreducible quadrangulations of the torus","volume":"67","author":"Nakamonto","year":"1996","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<223::AID-JGT7>3.0.CO;2-M","article-title":"Generating quadrangulations of surfaces with minimum degree at least 3","volume":"30","author":"Nakamonto","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/jgt.3190200211","article-title":"Note on irreducible triangulations of surfaces","volume":"20","author":"Nakamonto","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB20","unstructured":"S. Negami, A. Nakamonto, Diagonal transformations of graphs on closed surfaces, Sci. Rep. Yokohama Nat. Univ., Sec I, 1993, pp. 71\u201397."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB21","series-title":"The Four-Color Problem","author":"Ore","year":"1967"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB22","unstructured":"E. Steinitz, H. Rademacher, Vorlesungen \u00fcber die Theorie de Polyeder, Berlin, 1934."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB23","unstructured":"V.K. Titov, A constructive description of some classes of graphs, Doctoral Dissertation, Moscow, 1975."},{"issue":"2","key":"10.1016\/S0166-218X(02)00593-0_BIB24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0016-0032(73)90226-3","article-title":"Properties of a planar cubic graph","volume":"295","author":"Toida","year":"1972","journal-title":"J. Franklin Inst."},{"key":"10.1016\/S0166-218X(02)00593-0_BIB25","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0095-8956(74)90054-9","article-title":"Construction of quartic graphs","volume":"16","author":"Toida","year":"1974","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB26","doi-asserted-by":"crossref","unstructured":"W.T. Tutte, Connectivity in graphs, Mathematical Expositions, No. 15, University of Toronto Press, 1966.","DOI":"10.3138\/9781487584863"},{"key":"10.1016\/S0166-218X(02)00593-0_BIB27","doi-asserted-by":"crossref","unstructured":"N.C. Wormald, Classifying k-connected cubic graphs, in: Lecture Notes in Mathematics, Vol. 748, 1979, pp. 199\u2013206.","DOI":"10.1007\/BFb0102696"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T05:43:26Z","timestamp":1585028606000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X02005930"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00593-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}