{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:02Z","timestamp":1725897662863},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_14","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"157-168","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Ting","family":"Ung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"L. Andersen","year":"1992","unstructured":"Andersen, L.: The Strong Chromatic Index of a Cubic Graph Is at Most 10. Discrete Math.\u00a0108, 231\u2013252 (1992)","journal-title":"Discrete Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H. Bandelt","year":"1986","unstructured":"Bandelt, H., Mulder, H.: Distance-hereditary Graphs. J. Comb. Theory B\u00a041, 182\u2013208 (1986)","journal-title":"J. Comb. Theory B"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"Cameron, K.: Induced Matchings. Discrete Appl. Math.\u00a024, 97\u2013102 (1989)","journal-title":"Discrete Appl. Math."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2003.05.001","volume":"278","author":"K. Cameron","year":"2004","unstructured":"Cameron, K.: Induced Matchings in Intersection Graphs. Discrete Math.\u00a0278, 1\u20139 (2004)","journal-title":"Discrete Math."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K. Cameron","year":"2003","unstructured":"Cameron, K., Sritharan, R., Tang, Y.: Finding a Maximum Induced Matching in Weakly Chordal Graphs. Discrete Math.\u00a0266, 133\u2013142 (2003)","journal-title":"Discrete Math."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-63890-3_37","volume-title":"Algorithms and Computation","author":"M. Chang","year":"1997","unstructured":"Chang, M., Hsieh, S., Chen, G.: Dynamic Programming on Distance-hereditary Graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 344\u2013353. Springer, Heidelberg (1997)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D. Corneil","year":"1985","unstructured":"Corneil, D., Perl, Y., Stewart, L.: A Linear Recognition Algorithm for Cographs. SIAM J. Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"14_CR8","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D.: Classes of Graphs with Small Rank Decompositions Are \u03c7-bounded. Manuscript on ArXiv: 1107.2161.v1 (2011)."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Fomin, F., Golovach, P.A., Lokshtanov, D., Saurabh, S.: On the Price of Generality. In: Proceedings of the 20th Annual-SIAM Symposium on Discrete Algorithms, pp. 825\u2013834 (2009)","DOI":"10.1137\/1.9781611973068.90"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-10217-2_27","volume-title":"Combinatorial Algorithms","author":"R. Ganian","year":"2009","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: Better Polynomial Algorithms on Graphs of\u00a0Bounded Rank-Width. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 266\u2013277. Springer, Heidelberg (2009)"},{"key":"14_CR11","first-page":"129","volume-title":"Combinatorial Mathematics and its Applications","author":"R. Halin","year":"1971","unstructured":"Halin, R.: Studies on Minimally n-connected Graphs. In: Welsh, D. (ed.) Combinatorial Mathematics and its Applications, pp. 129\u2013136. Academic Press, London (1971)"},{"key":"14_CR12","first-page":"1549","volume":"3","author":"R. Hayward","year":"2007","unstructured":"Hayward, R., Spinrad, J., Sritharan, R.: Improved Algorithms for Weakly Chordal Graphs. ACM Trans. Alg.\u00a03, 1549\u20136325 (2007)","journal-title":"ACM Trans. Alg."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"Howorka, E.: A Characterization of Distance-hereditary Graphs. Q. J. Math.\u00a028, 417\u2013420 (1977)","journal-title":"Q. J. Math."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth \u2013 Computations and Approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"1536","DOI":"10.1016\/j.disc.2011.09.016","volume":"312","author":"H. Lai","year":"2012","unstructured":"Lai, H., Lih, K., Tsai, P.: The Strong Chromatic Index of Halin Graphs. Discrete Math.\u00a0312, 1536\u20131541 (2012)","journal-title":"Discrete Math."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(83)90068-9","volume":"6","author":"R. Laskar","year":"1983","unstructured":"Laskar, R., Shier, D.: On Powers and Centers of Chordal Graphs. Discrete Appl. Math.\u00a06, 139\u2013147 (1983)","journal-title":"Discrete Appl. Math."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.aml.2011.10.046","volume":"25","author":"K. Lih","year":"2012","unstructured":"Lih, K., Liu, D.: On the Strong Chromatic Index of Cubic Halin Graphs. Appl. Math. Lett.\u00a025, 898\u2013901 (2012)","journal-title":"Appl. Math. Lett."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M. Molloy","year":"1997","unstructured":"Molloy, M., Reed, B.: A Bound on the Strong Chromatic Index of a Graph. J. Comb. Theory B.\u00a069, 103\u2013109 (1997)","journal-title":"J. Comb. Theory B."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.dam.2008.07.011","volume":"157","author":"M. Moser","year":"2009","unstructured":"Moser, M., Sikdar, S.: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. Discrete Appl. Math.\u00a0157, 715\u2013727 (2009)","journal-title":"Discrete Appl. Math."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.dam.2004.03.001","volume":"143","author":"M. Salavatipour","year":"2004","unstructured":"Salavatipour, M.: A Polynomial Algorithm for Strong Edge Coloring of Partial k-trees. Discrete Appl. Math.\u00a0143, 285\u2013291 (2004)","journal-title":"Discrete Appl. Math."},{"key":"14_CR21","first-page":"211","volume":"57","author":"W. Shiu","year":"2006","unstructured":"Shiu, W., Lam, P., Tam, W.: On Strong Chromatic Index of Halin Graphs. J. Comb. Math. Comb. Comput.\u00a057, 211\u2013222 (2006)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.aml.2008.08.019","volume":"22","author":"W. Shiu","year":"2009","unstructured":"Shiu, W., Tam, W.: The Strong Chromatic Index of Complete Cubic Halin Graphs. Appl. Math. Lett.\u00a022, 754\u2013758 (2009)","journal-title":"Appl. Math. Lett."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Wolk, E.: A Note on \u201cThe Comparability Graph of a Tree\u201d. In: Proceedings of the American Mathematical Society, vol.\u00a016, pp. 17\u201320 (1965)","DOI":"10.2307\/2033992"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:58:46Z","timestamp":1620129526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}