{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:51Z","timestamp":1725795891274},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_80","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"967-978","source":"Crossref","is-referenced-by-count":4,"title":["The Mondshein Sequence"],"prefix":"10.1007","author":[{"given":"Jens M.","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"80_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.7155\/jgaa.00219","volume":"15","author":"M. Badent","year":"2011","unstructured":"Badent, M., Brandes, U., Cornelsen, S.: More canonical ordering. J. Graph Algorithms Appl.\u00a015(1), 97\u2013126 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"80_CR2","doi-asserted-by":"crossref","unstructured":"Barnette, D.W., Gr\u00fcnbaum, B.: On Steinitz\u2019s theorem concerning convex 3-polytopes and on some properties of planar graphs. In: Many Facets of Graph Theory, pp. 27\u201340 (1969)","DOI":"10.1007\/BFb0060102"},{"key":"80_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-45749-6_25","volume-title":"Algorithms - ESA 2002","author":"U. Brandes","year":"2002","unstructured":"Brandes, U.: Eager st-ordering. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 247\u2013256. Springer, Heidelberg (2002)"},{"issue":"4","key":"80_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J. Cheriyan","year":"1988","unstructured":"Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms\u00a09(4), 507\u2013537 (1988)","journal-title":"J. Algorithms"},{"issue":"5","key":"80_CR5","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1137\/S0097539703436734","volume":"35","author":"S. Curran","year":"2006","unstructured":"Curran, S., Lee, O., Yu, X.: Finding four independent trees. SIAM Journal on Computing\u00a035(5), 1023\u20131058 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"80_CR6","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting fary embeddings of planar graphs. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"issue":"1","key":"80_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"4","key":"80_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica\u00a023(4), 302\u2013340 (1999)","journal-title":"Algorithmica"},{"issue":"3","key":"80_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput.\u00a02(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"80_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","volume":"15","author":"A. Huck","year":"1999","unstructured":"Huck, A.: Independent trees in planar graphs. Graphs and Combinatorics\u00a015(1), 29\u201377 (1999)","journal-title":"Graphs and Combinatorics"},{"key":"80_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A. Itai","year":"1988","unstructured":"Itai, A., Rodeh, M.: The multi-tree approach to reliability in distributed networks. Information and Computation\u00a079, 43\u201359 (1988)","journal-title":"Information and Computation"},{"key":"80_CR12","doi-asserted-by":"crossref","unstructured":"Kant, G.: Drawing planar graphs using the lmc-ordering. In: Proceedings of the 33th Annual Symposium on Foundations of Computer Science (FOCS 1992), pp. 101\u2013110 (1992)","DOI":"10.1109\/SFCS.1992.267814"},{"issue":"1","key":"80_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"80_CR14","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Computing ears and branchings in parallel. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS 1985), pp. 464\u2013467 (1985)","DOI":"10.1109\/SFCS.1985.16"},{"key":"80_CR15","unstructured":"Mondshein, L.F.: Combinatorial Ordering and the Geometric Embedding of Graphs. PhD thesis, M.I.T. Lincoln Laboratory \/ Harvard University (1971), Technical Report, available at http:\/\/www.dtic.mil\/cgi-bin\/GetTRDoc?AD=AD0732882"},{"key":"80_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-45061-0_4","volume-title":"Automata, Languages and Programming","author":"P. Mutzel","year":"2003","unstructured":"Mutzel, P.: The SPQR-tree data structure in graph drawing. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 34\u201346. Springer, Heidelberg (2003)"},{"issue":"2","key":"80_CR17","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/110848311","volume":"42","author":"J.M. Schmidt","year":"2013","unstructured":"Schmidt, J.M.: Contractions, removals and certifying 3-connectivity in linear time. SIAM Journal on Computing\u00a042(2), 494\u2013535 (2013)","journal-title":"SIAM Journal on Computing"},{"key":"80_CR18","unstructured":"Suzuki, H., Takahashi, N., Nishizek, T., Miyano, H., Ueno, S.: An algorithm for tripartitioning 3-connected graphs. Information Processing Society of Japan (IPSJ)\u00a031(5), 584\u2013592 (1990) (in Japanese)."},{"issue":"3","key":"80_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/jgt.3190050304","volume":"5","author":"C. Thomassen","year":"1981","unstructured":"Thomassen, C.: Kuratowski\u2019s theorem. J. Graph Theory\u00a05(3), 225\u2013241 (1981)","journal-title":"J. Graph Theory"},{"key":"80_CR20","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc.\u00a013, 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."},{"key":"80_CR21","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Connectivity in graphs. In: Mathematical Expositions, vo.\u00a015, University of Toronto Press (1966)","DOI":"10.3138\/9781487584863"},{"key":"80_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/3-540-57899-4_47","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K. Wada","year":"1994","unstructured":"Wada, K., Kawaguchi, K.: Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol.\u00a0790, pp. 132\u2013143. Springer, Heidelberg (1994)"},{"issue":"1","key":"80_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc.\u00a034(1), 339\u2013362 (1932)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"80_CR24","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/jgt.3190130205","volume":"13","author":"A. Zehavi","year":"1989","unstructured":"Zehavi, A., Itai, A.: Three tree-paths. J. Graph Theory\u00a013(2), 175\u2013188 (1989)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T18:11:25Z","timestamp":1597947085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}