{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:44Z","timestamp":1725500744006},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_29","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T11:36:53Z","timestamp":1358768213000},"page":"310-321","source":"Crossref","is-referenced-by-count":3,"title":["On Graphs That Are Not PCGs"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.disc.2009.10.006","volume":"310","author":"A. Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Hundt, C., Mancini, F., Wagner, P.: Rooted directed path graphs are leaf powers. Discrete Mathematics\u00a0310(4), 897\u2013910 (2010)","journal-title":"Discrete Mathematics"},{"issue":"31-33","key":"29_CR2","doi-asserted-by":"publisher","first-page":"2968","DOI":"10.1016\/j.tcs.2010.04.027","volume":"411","author":"A. Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Le, V.B., Rautenbach, D.: Exact leaf powers. Theoretical Computer Science\u00a0411(31-33), 2968\u20132977 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2009.09.008","volume":"158","author":"A. Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Wagner, P.: Characterising (k, l)-leaf powers. Discrete Applied Mathematics\u00a0158(2), 110\u2013122 (2010)","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Calamoneri, T., Frascaria, D., Sinaimeri, B.: All graphs with at most seven vertices are pairwise compatibility graphs. The Computer Journal (to appear, 2012), http:\/\/arxiv.org\/abs\/1202.4631","key":"29_CR4","DOI":"10.1093\/comjnl\/bxs087"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-28076-4_14","volume-title":"WALCOM: Algorithms and Computation","author":"T. Calamoneri","year":"2012","unstructured":"Calamoneri, T., Petreschi, R., Sinaimeri, B.: On Relaxing the Constraints in Pairwise Compatibility Graphs. In: Rahman, M. S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 124\u2013135. Springer, Heidelberg (2012)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-92182-0_37","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Meister, D., Rosamond, F.A., Sritharan, R., Telle, J.A.: Leaf Powers and Their Properties: Using the Trees. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 402\u2013413. Springer, Heidelberg (2008)"},{"key":"29_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-39763-2_14","volume-title":"Algorithms in Bioinformatics","author":"P.E. Kearney","year":"2003","unstructured":"Kearney, P.E., Munro, J.I., Phillips, D.: Efficient Generation of Uniform Samples from Phylogenetic Trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 177\u2013189. Springer, Heidelberg (2003)"},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jda.2005.06.005","volume":"4","author":"W.S. Kennedy","year":"2006","unstructured":"Kennedy, W.S., Lin, G., Yan, G.: Strictly chordal graphs are leaf powers. Journal of Discrete Algorithms\u00a04(4), 511\u2013525 (2006)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N. Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: On graph powers for leaf-labeled trees. Journal of Algorithms\u00a042(1), 69\u2013108 (2002)","journal-title":"Journal of Algorithms"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-28076-4_13","volume-title":"WALCOM: Algorithms and Computation","author":"S.A. Salma","year":"2012","unstructured":"Salma, S.A., Rahman, M.S.: Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs. In: Rahman, M. S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 112\u2013123. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226 (1978)","key":"29_CR11","DOI":"10.1145\/800133.804350"},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1142\/S1793830910000917","volume":"2","author":"M.N. Yanhaona","year":"2010","unstructured":"Yanhaona, M.N., Bayzid, M.S., Rahman, M.S.: Discovering pairwise compatibility graphs. Discrete Mathematics, Algorithms and Applications\u00a02(4), 607\u2013623 (2010)","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"issue":"1-2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s12190-008-0204-7","volume":"30","author":"M.N. Yanhaona","year":"2009","unstructured":"Yanhaona, M.N., Hossain, K.S.M.T., Rahman, M.S.: Pairwise compatibility graphs. Journal of Applied Mathematics and Computing\u00a030(1-2), 479\u2013503 (2009)","journal-title":"Journal of Applied Mathematics and Computing"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:35:01Z","timestamp":1620120901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}