{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:21:49Z","timestamp":1649186509853},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf02988313","type":"journal-article","created":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T11:36:16Z","timestamp":1226748976000},"page":"239-253","source":"Crossref","is-referenced-by-count":0,"title":["Planar graphs and greatest common subgraphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Grzegorz","family":"Kubicki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02988313_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF02188190","volume":"31","author":"G. Chartrand","year":"1986","unstructured":"Chartrand, G., Johnson, M., Oellermann, O.R.: Connected graphs containing a given connected graph as a unique greatest common subgraph. Aequations Math.31, 213\u2013222 (1986)","journal-title":"Aequations Math."},{"key":"BF02988313_CR2","volume-title":"Graphs and digraphs","author":"G. Chartrand","year":"1986","unstructured":"Chartrand, G., Lesniak, L.: Graphs and digraphs, 2nd edn. Monterey: Wadsworth and Brooks\/Cole 1986","edition":"2nd edn."},{"key":"BF02988313_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01788654","volume":"5","author":"G. Chartrand","year":"1989","unstructured":"Chartrand, G., Oellermann, O.R., Saba, F., Zou, H.B.: Greatest common subgraphs with specified properties. Graphs Comb.5, 1\u201314 (1989)","journal-title":"Graphs Comb."},{"key":"BF02988313_CR4","first-page":"87","volume":"110","author":"G. Chartrand","year":"1985","unstructured":"Chartrand, G., Saba, F., Zou, H.B.: Edge rotations and distance between graphs. Cas. Pestovani Mat.110, 87\u201391 (1985)","journal-title":"Cas. Pestovani Mat."},{"key":"BF02988313_CR5","first-page":"80","volume":"112","author":"G. Chartrand","year":"1987","unstructured":"Chartrand, G., Saba, F., Zou, H.B.: Greatest common subgraphs of graphs. Cas. Pestovani Mat.112, 80\u201388 (1987)","journal-title":"Cas. Pestovani Mat."},{"key":"BF02988313_CR6","first-page":"33","volume":"1","author":"G. Chartrand","year":"1988","unstructured":"Chartrand, G., Zou, H.B.: Trees and greatest common subgraphs. Scientia1, 33\u201339 (1988)","journal-title":"Scientia"},{"key":"BF02988313_CR7","unstructured":"Etourneau, E.: Existence and connectivity of planar graphs having 12 vertices of degree 5 andn \u2014 12 vertices of degree 6. In: A. Hajnal et al. Infinite and finite sets, Colloq. Math. Soc. J. Bolyai. Amsterdam-Oxford-New York: North-Holland 1975"},{"key":"BF02988313_CR8","volume-title":"Convex polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"Gr\u00fcnbaum, B.: Convex polytopes. New York: Willey-Interscience 1967"},{"key":"BF02988313_CR9","doi-asserted-by":"crossref","first-page":"744","DOI":"10.4153\/CJM-1963-071-3","volume":"15","author":"B. Gr\u00fcnbaum","year":"1963","unstructured":"Gr\u00fcnbaum, B., Motzkin, T.: The number of hexagons and the simplicity of geodesics on certain polyhedra. Can. J. Math.15, 744\u2013751 (1963)","journal-title":"Can. J. Math."},{"key":"BF02988313_CR10","first-page":"185","volume":"71","author":"G. Kubicki","year":"1990","unstructured":"Kubicki, G.: Outerplanar graphs and greatest common subgraphs. Congr. Numerantium71, 185\u2013196 (1990)","journal-title":"Congr. Numerantium"},{"key":"BF02988313_CR11","first-page":"300","volume-title":"International conference in graph theory, combinatorics, algorithms, and applications","author":"G. Kubicki","year":"1991","unstructured":"Kubicki, G.: Unicyclic graphs and greatest common subgraphs. International conference in graph theory, combinatorics, algorithms, and applications edited by Y. Alavi. SIAM, Philadelphia 300\u2013318 (1991)"},{"key":"BF02988313_CR12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Amer. J. Math.54, 150\u2013168 (1932)","journal-title":"Amer. J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02988313.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02988313\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02988313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:03:34Z","timestamp":1558476214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02988313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":12,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF02988313"],"URL":"https:\/\/doi.org\/10.1007\/bf02988313","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}