{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T21:14:28Z","timestamp":1660252468486},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"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":[[2009,5]]},"DOI":"10.1007\/s00373-008-0833-5","type":"journal-article","created":{"date-parts":[[2009,5,22]],"date-time":"2009-05-22T11:42:35Z","timestamp":1242992555000},"page":"197-217","source":"Crossref","is-referenced-by-count":6,"title":["Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Ellen","family":"Gethner","sequence":"first","affiliation":[]},{"given":"Thom","family":"Sulanke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,23]]},"reference":[{"key":"833_CR1","doi-asserted-by":"crossref","unstructured":"Appel, K., Haken, W.: Supplement to: \u201cEvery planar map is four colorable. I. Discharging\u201d (Illinois J. Math. 21 (1977), no. 3, 429\u2013490) by Appel and Haken; \u201cII. Reducibility\u201d (ibid. 21 (1977), no. 3, 491\u2013567) by Appel, Haken and J. Koch. Illinois J. Math., 21(3), 1\u2013251. (microfiche supplement) (1977)","DOI":"10.1215\/ijm\/1256049011"},{"key":"833_CR2","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. Part II. Reducibility. Illinois J. Math., 21, 491\u2013567 (1977)"},{"key":"833_CR3","unstructured":"Albertson, M.O.: A conjecture on the independence ratio of thickness-two graphs. (Personal communication)."},{"key":"833_CR4","doi-asserted-by":"crossref","unstructured":"Boutin, D.L., Gethner, E., Sulanke, T.: Thickness-two graphs. I. New nine-critical graphs, permuted layer graphs, and Catlin\u2019s graphs. J. Graph Theory, 57(3), 198\u2013214 (2008)","DOI":"10.1002\/jgt.20282"},{"key":"833_CR5","unstructured":"Battle, J., Harary, F., Kodama, Y.: Every planar graph with nine points has a nonplanar complement. Bull. Amer. Math. Soc., 68, 569\u2013571 (1962)"},{"key":"833_CR6","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical games. Sci. Amer., 242, 14\u201319 February 1980","DOI":"10.1038\/scientificamerican0480-19"},{"key":"833_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, (1990)"},{"key":"833_CR8","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In STOC \u201974: Proceedings of the sixth annual ACM symposium on Theory of computing, pp. 47\u201363, ACM Press New York, NY, USA, 1974."},{"key":"833_CR9","unstructured":"Guy, R.K., Nowakowski, R.J.: The outerthickness & outercoarseness of graphs. I. The complete graph & the n-cube. In: Topics in combinatorics and graph theory (Oberwolfach, 1990), pp. 297\u2013310. Physica, Heidelberg (1990)"},{"key":"833_CR10","doi-asserted-by":"crossref","unstructured":"Guy, R.K., Nowakowski, R.J.: The outerthickness & outercoarseness of graphs. II. The complete bipartite graph. In: Contemporary methods in graph theory, pp. 313\u2013322. Bibliographisches Inst., Mannheim (1990)","DOI":"10.1007\/978-3-642-46908-4_34"},{"key":"833_CR11","unstructured":"Haj\u00f3s, G.: \u00dcber eine Konstruktion nicht n-f\u00e4rbbarer Graphen. Wiss. Z. Martin Luther Univ., 10, 116\u2013117 (1961)"},{"key":"833_CR12","unstructured":"Hutchinson, J.P.: Coloring ordinary maps, maps of empires and maps of the moon. Math. Mag., 66(4), 211\u2013226 (1993)"},{"key":"833_CR13","doi-asserted-by":"crossref","unstructured":"Jensen, T.R., Royle, G.F.: Haj\u00f3s constructions of critical graphs. J. Graph Theory, 30(1), 37\u201350 (1999)","DOI":"10.1002\/(SICI)1097-0118(199901)30:1<37::AID-JGT5>3.0.CO;2-V"},{"key":"833_CR14","unstructured":"Kocay, W., Kreher, D.L.: Graphs, algorithms, and optimization. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall\/CRC, Boca Raton, FL (2005)"},{"key":"833_CR15","unstructured":"Koester, G.: 4-critical 4-valent planar graphs constructed with crowns. Math. Scand., 67(1), 15\u201322 (1990)"},{"key":"833_CR16","unstructured":"Mansfield, A.: Determining the thickness of graphs is NP-hard. Math. Proc. Cambridge Philos. Soc., 93(1), 9\u201323 (1983)"},{"key":"833_CR17","unstructured":"McKay, B.D.: Groups and Graphs: software package for graphs, digraphs, graph embeddings, projective configurations, polyhedra, convex hulls, combinatorial designs, automorphism groups, and fractals. Website, 1997-2007. http:\/\/www.paddle.mb.ca\/G&G\/G&G.html\/"},{"key":"833_CR18","unstructured":"Ringel, G.: F\u00e4rbungsprobleme auf Fl\u00e4chen und Graphen, volume 2 of Mathematische Monographien. VEB Deutscher Verlag der Wissenschaften, Berlin (1959)"},{"key":"833_CR19","doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: A new proof of the four-colour theorem. Electron. Res. Announc. Amer. Math. Soc., 2(1), 17\u201325 (electronic) (1996)","DOI":"10.1090\/S1079-6762-96-00003-0"},{"key":"833_CR20","unstructured":"Sulanke, T.: Decomposing graphs into triangulations using random diagonal flips. (in preparation)"},{"key":"833_CR21","unstructured":"Tutte, W.T.: The non-biplanar character of the complete 9-graph. Canad. Math. Bull., 6, 319\u2013330 (1963)"},{"key":"833_CR22","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall Inc., Upper Saddle River, NJ, second edition (2001)"},{"key":"833_CR23","unstructured":"Wilson, R.: Four colors suffice. Princeton University Press, Princeton, NJ, 2002. How the map problem was solved"},{"key":"833_CR24","unstructured":"Wolfram, S.: Wolfram Research, Inc: Mathematica. Website, 1997-2007. http:\/\/www.wolfram.com"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0833-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0833-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0833-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0833-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["833"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0833-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}