{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:51:08Z","timestamp":1743133868895,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_48","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"609-623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions"],"prefix":"10.1007","author":[{"given":"Marc","family":"Hellmuth","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Wieseke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","volume":"165\u2013166","author":"D Achlioptas","year":"1997","unstructured":"Achlioptas, D.: The complexity of g-free colourability. Discrete Mathematics 165\u2013166, 21\u201330 (1997). Graphs and Combinatorics","journal-title":"Discrete Mathematics"},{"key":"48_CR2","unstructured":"Bernini, A., Ferrari, L., Pinzani, R.: Enumeration of some classes of words avoiding two generalized patterns of length three. arXiv preprint arXiv:0711.3387 (2007)"},{"issue":"2","key":"48_CR3","first-page":"3","volume":"16","author":"S Bilotta","year":"2013","unstructured":"Bilotta, S., Grazzini, E., Pergola, E., Morgagni, V.G.B.: Counting binary words avoiding alternating patterns. Journal of Integer Sequences 16(2), 3 (2013)","journal-title":"Journal of Integer Sequences"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/aima.1998.1743","volume":"138","author":"S B\u00f6cker","year":"1998","unstructured":"B\u00f6cker, S., Dress, A.W.M.: Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv. Math. 138, 105\u2013125 (1998)","journal-title":"Adv. Math."},{"issue":"1","key":"48_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jcta.2004.10.007","volume":"110","author":"P Br\u00e4nd\u00e9n","year":"2005","unstructured":"Br\u00e4nd\u00e9n, P., Mansour, T.: Finite automata and pattern avoidance in words. Journal of Combinatorial Theory, Series A 110(1), 127\u2013145 (2005)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Soc. Ind. Appl. Math., Philadephia (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"2","key":"48_CR7","first-page":"1","volume":"9","author":"A Burstein","year":"2002","unstructured":"Burstein, A., Mansour, T.: Words restricted by patterns with at most 2 distinct letters. Electron. J. Combin. Number Theory 9(2), 1\u201316 (2002)","journal-title":"Electron. J. Combin. Number Theory"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.K.S.: Complement reducible graphs. Discr. Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"48_CR9","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"48_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/jgt.21724","volume":"75","author":"P Dorbec","year":"2014","unstructured":"Dorbec, P., Montassier, M., Ochem, P.: Vertex partitions of graphs into cographs and stars. Journal of Graph Theory 75(1), 75\u201390 (2014)","journal-title":"Journal of Graph Theory"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S1571-0653(04)00115-5","volume":"11","author":"J Gimbel","year":"2002","unstructured":"Gimbel, J., Nes\u011btr\u01d0l, J.: Partitions of graphs into cographs. Electronic Notes in Discrete Mathematics 11, 705\u2013721 (2002). The Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"48_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product graphs, 2nd edn. CRC Press, Boca Raton (2011)","edition":"2"},{"issue":"1\u20132","key":"48_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M Hellmuth","year":"2013","unstructured":"Hellmuth, M., Hernandez-Rosales, M., Huber, K.T., Moulton, V., Stadler, P.F., Wieseke, N.: Orthology relations, symbolic ultrametrics, and cographs. Journal of Mathematical Biology 66(1\u20132), 399\u2013420 (2013)","journal-title":"Journal of Mathematical Biology"},{"issue":"7","key":"48_CR14","doi-asserted-by":"publisher","first-page":"2058","DOI":"10.1073\/pnas.1412770112","volume":"112","author":"M Hellmuth","year":"2015","unstructured":"Hellmuth, M., Wiesecke, N., Lenhof, H.P., Middendorf, M., Stadler, P.F.: Phylogenomics with paralogs. PNAS 112(7), 2058\u20132063 (2015)","journal-title":"PNAS"},{"issue":"Suppl. 6","key":"48_CR15","doi-asserted-by":"publisher","first-page":"S12","DOI":"10.1186\/1471-2164-15-S6-S12","volume":"15","author":"M Lafond","year":"2014","unstructured":"Lafond, M., El-Mabrouk, N.: Orthology and paralogy constraints: satisfiability and consistency. BMC Genomics 15(Suppl. 6), S12 (2014)","journal-title":"BMC Genomics"},{"key":"48_CR16","unstructured":"Lerchs, H.: On cliques and kernels. Technical report, Dept. of Comput. Sci. University of Toronto (1971)"},{"key":"48_CR17","unstructured":"Lerchs, H.: On the clique-kernel structure of graphs. Technical report, Dept. of Comput. Sci. University of Toront (1971)"},{"key":"48_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-22685-4_10","volume-title":"Computing and Combinatorics","author":"Y Liu","year":"2011","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Cograph editing: complexity and parameterized algorithms. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 110\u2013121. Springer, Heidelberg (2011)"},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2011.11.040","volume":"461","author":"Y Liu","year":"2012","unstructured":"Liu, Y., Wang, J., Guo, J., Chen, J.: Complexity and parameterized algorithms for cograph editing. Theoretical Computer Science 461, 45\u201354 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"48_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra, J., Gries, D.: A constructive proof of vizing\u2019s theorem. Information Processing Letters 41(3), 131\u2013133 (1992)","journal-title":"Information Processing Letters"},{"key":"48_CR21","unstructured":"Moret, B.M.: The Theory of Computation. Addison-Wesley (1997)"},{"key":"48_CR22","unstructured":"Pudwell, L.K.: Enumeration schemes for pattern-avoiding words and permutations. ProQuest (2008)"},{"issue":"A40","key":"48_CR23","first-page":"1","volume":"8","author":"LK Pudwell","year":"2008","unstructured":"Pudwell, L.K.: Enumeration schemes for words avoiding patterns with repeated letters. Electron. J. Combin. Number Theory 8(A40), 1\u201319 (2008)","journal-title":"Electron. J. Combin. Number Theory"},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. ACM, New York (1978)","DOI":"10.1145\/800133.804350"},{"key":"48_CR25","first-page":"23","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Journal of Mathematical Biology 3, 23\u201330 (1964). (Russian)","journal-title":"Journal of Mathematical Biology"},{"key":"48_CR26","unstructured":"Zhang, P.: A study on generalized solution concepts in constraint satisfaction and graph colouring. Master\u2019s thesis, University of British Columbia, Canada (2014)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T18:32:28Z","timestamp":1674239548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}