{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:52:26Z","timestamp":1695603146196},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90198-x","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"185-195","source":"Crossref","is-referenced-by-count":10,"title":["On k-minimally n-edge-connected graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"Stephen B.","family":"Maurer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Slater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90198-X_BIB1","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0012-365X(78)90198-X_BIB2","article-title":"Problem Session, Fifth British Combinatorial Conference","author":"Frank","year":"1975"},{"key":"10.1016\/0012-365X(78)90198-X_BIB3","article-title":"Combinatorial algorithms, algorithms proofs","author":"Frank","year":"1975","journal-title":"Doctoral Dissertation"},{"key":"10.1016\/0012-365X(78)90198-X_BIB4","article-title":"Lecture at the Fifth Hungarian Combinatorial Colloquim","author":"Gy\u00f6ry","year":"1976"},{"key":"10.1016\/0012-365X(78)90198-X_BIB5","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(78)90198-X_BIB6","first-page":"178","article-title":"Minimally n-line connected graphs","volume":"252","author":"Lick","year":"1972","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0012-365X(78)90198-X_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01896190","article-title":"A bornology theory for spanning trees of a graph","volume":"30","author":"Lov\u00e1sz","year":"1977","journal-title":"Acta Math. Acad. Sci. Hungaria"},{"key":"10.1016\/0012-365X(78)90198-X_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","article-title":"Minimale n-fach kantenusammenh\u00e4ngen de Graphen","volume":"191","author":"Mader","year":"1971","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(78)90198-X_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01304873","article-title":"Ezken vom Grad n in minimalen n-fach zusammenh\u00e4ngenden Graphen","volume":"23","author":"Mader","year":"1972","journal-title":"Arch. Math."},{"key":"10.1016\/0012-365X(78)90198-X_BIB10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01295482","article-title":"Kantendisjunkte Wege in Graphen","volume":"78","author":"Mader","year":"1974","journal-title":"Monatsh. Math"},{"key":"10.1016\/0012-365X(78)90198-X_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01238648","article-title":"Ezken vom Innen-und Aussengrad n in minimalen n-fach kantenzusammenh\u00e4ngenden Digraphen","volume":"25","author":"Mader","year":"1974","journal-title":"Arch. Math."},{"key":"10.1016\/0012-365X(78)90198-X_BIB12","doi-asserted-by":"crossref","unstructured":"S. Maurer, Vertex colorings without isolates, J. Combinatorial Theory Ser. B (to appear).","DOI":"10.1016\/0095-8956(79)90020-0"},{"key":"10.1016\/0012-365X(78)90198-X_BIB13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(77)90174-1","article-title":"On a critical, n-connected graphs","volume":"20","author":"Maurer","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(78)90198-X_BIB14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Sur allgemeinen Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"key":"10.1016\/0012-365X(78)90198-X_BIB15","unstructured":"K. Milliken, Partitioning 3-connected graphs into 3 connected subgraphs, unpublished."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7890198X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7890198X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T12:21:40Z","timestamp":1554898900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X7890198X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X7890198X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90198-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}