{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:20:59Z","timestamp":1725603659334},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_12","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"131-142","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Finding a Maximum Non-k-linked Graph"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01261316","volume":"16","author":"B. Bollob\u00e1s","year":"1996","unstructured":"Bollob\u00e1s, B., Thomason, A.: Highly linked graphs. Combinatorica\u00a016, 313\u2013320 (1996)","journal-title":"Combinatorica"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.endm.2004.06.019","volume":"18","author":"L. Faria","year":"2004","unstructured":"Faria, L., de Figueiredo, C.M.H., Gravier, S., Mendon\u00e7, C.F., Stolfi, J.: Nonplanar vertex deletion: maximum degree thresholds for NP\/Max SNP-hardness and a \n                    \n                      \n                    \n                    $\\frac{3}{4}$\n                  -approximation for finding maximum planar induced subgraphs. Electronic Notes in Discrete Mathematics\u00a018, 121\u2013126 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/jgt.20283","volume":"57","author":"M. Ferrara","year":"2008","unstructured":"Ferrara, M., Gould, R.J., Tansey, G., Whalen, T.: On H-immersions. Journal of Graph Theory\u00a057, 245\u2013254 (2008)","journal-title":"Journal of Graph Theory"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00373-006-0651-6","volume":"22","author":"M. Ferrara","year":"2006","unstructured":"Ferrara, M., Gould, R., Tansey, G., Whalen, T.: On H-linked graphs. Graphs and Combinatorics\u00a022, 217\u2013224 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010, 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/050624662","volume":"20","author":"R.J. Gould","year":"2006","unstructured":"Gould, R.J., Kostochka, A., Yu, G.: On minimum degree implying that a graph is H-linked. SIAM J. Discret. Math.\u00a020, 829\u2013840 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF01787639","volume":"7","author":"A. Huck","year":"1991","unstructured":"Huck, A.: A sufficient condition for graphs to be weakly k-linked. Graphs and Combinatorics\u00a07, 323\u2013351 (1991)","journal-title":"Graphs and Combinatorics"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01350174","volume":"187","author":"H. Jung","year":"1970","unstructured":"Jung, H.: Eine Verallgemeinerung des n-fachen Zusammenhangs f\u00fcr Graphen. Mathematische Annalen\u00a0187, 95\u2013103 (1970)","journal-title":"Mathematische Annalen"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R.M. Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks\u00a05, 45\u201368 (1975)","journal-title":"Networks"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0963548305007479","volume":"15","author":"K. Kawarabayashi","year":"2006","unstructured":"Kawarabayashi, K., Kostochka, A., Yu, G.: On sufficient degree conditions for a graph to be k-linked. Comb. Probab. Comput.\u00a015, 685\u2013694 (2006)","journal-title":"Comb. Probab. Comput."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/jgt.20115","volume":"50","author":"A. Kostochka","year":"2005","unstructured":"Kostochka, A., Yu, G.: An extremal problem for H-linked graphs. J. Graph Theory\u00a050, 321\u2013339 (2005)","journal-title":"J. Graph Theory"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.1016\/j.dam.2006.11.013","volume":"156","author":"A. Kostochka","year":"2008","unstructured":"Kostochka, A., Yu, G.: Minimum degree conditions for H-linked graphs. Discrete Appl. Math.\u00a0156, 1542\u20131548 (2008)","journal-title":"Discrete Appl. Math."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1002\/jgt.20295","volume":"58","author":"A.V. Kostochka","year":"2008","unstructured":"Kostochka, A.V., Yu, G.: Ore-type degree conditions for a graph to be H-linked. J. Graph Theory\u00a058, 14\u201326 (2008)","journal-title":"J. Graph Theory"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1112\/plms\/s3-20.1.144","volume":"20","author":"D. Larman","year":"1970","unstructured":"Larman, D., Mani, P.: On the existence of certain configurations within graphs and the 1-skeletons of polytopes. Proc. of the London Mathematical Society\u00a020, 144\u2013160 (1970)","journal-title":"Proc. of the London Mathematical Society"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A. Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs \u2013 a survey and annotated bibliography. J. Graph Algorithms Appl.\u00a05, 1\u201374 (2001)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. the disjoint paths problem. Journal of Combinatorial Theory B63, 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N. Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XXIII. Nash-Williams\u2019 immersion conjecture. Journal of Combinatorial Theory, Series B\u00a0100, 181\u2013205 (2010)","journal-title":"Nash-Williams\u2019 immersion conjecture. Journal of Combinatorial Theory, Series B"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P.D. Seymour","year":"1980","unstructured":"Seymour, P.D.: Disjoint paths in graphs. Discrete Mathematics\u00a029, 293\u2013309 (1980)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. Journal of the ACM\u00a027(3), 445\u2013456 (1980)","journal-title":"Journal of the ACM"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R. Thomas","year":"2005","unstructured":"Thomas, R., Wollan, P.: An improved linear edge bound for graph linkages. European Journal of Combinatorics\u00a026, 309\u2013324 (2005)","journal-title":"European Journal of Combinatorics"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"Thomassen, C.: 2-linked graphs. European Journal of Combinatorics\u00a01, 371\u2013378 (1980)","journal-title":"European Journal of Combinatorics"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF01275674","volume":"11","author":"C. Thomassen","year":"1991","unstructured":"Thomassen, C.: Highly connected non-2-linked digraphs. Combinatorica\u00a011, 393\u2013395 (1991)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T15:26:28Z","timestamp":1554132388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}