{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:24:22Z","timestamp":1774369462433,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540204527","type":"print"},{"value":"9783540398905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_24","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"273-283","source":"Crossref","is-referenced-by-count":8,"title":["On the Recognition of General Partition Graphs"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[]},{"given":"Chuan-Min","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jiping","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"285","volume":"16","author":"C. Anbeek","year":"1997","unstructured":"Anbeek, C., DeTemple, D., McAvaney, K., Robertson, J.: When are chordal graphs also partition graphs? Australas. J. Combin.\u00a016, 285\u2013293 (1997)","journal-title":"Australas. J. Combin."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes\u2013A Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/3-540-63165-8_229","volume-title":"Automata, Languages and Programming","author":"H.J. Broersma","year":"1997","unstructured":"Broersma, H.J., Kloks, T., Kratsch, D., M\u00fcller, H.: Independent sets in AT-free graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 760\u2013770. Springer, Heidelberg (1997)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"S. Bron","year":"1973","unstructured":"Bron, S., Kerbosch, J.: Algorithm 457\u2013Finding all cliques of an undirected graph. Comm. of ACM\u00a016, 575 (1973)","journal-title":"Comm. of ACM"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Slater, P.J.: A note on well-covered graphs. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol.\u00a055, pp. 179\u2013182 (1993)","DOI":"10.1016\/S0167-5060(08)70387-X"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.K.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics\u00a010, 399\u2013430 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(93)90520-4","volume":"113","author":"D.W. DeTemple","year":"1993","unstructured":"DeTemple, D.W., Dineen, M.J., Robertson, J.M., McAvaney, K.L.: Recent examples in the theory of partition graphs. Discrete Mathematics\u00a0113, 255\u2013258 (1993)","journal-title":"Discrete Mathematics"},{"key":"24_CR8","first-page":"121","volume":"13","author":"D. DeTemple","year":"1987","unstructured":"DeTemple, D., Harary, F., Robertson, J.: Partition graphs. Soochow J. Math.\u00a013, 121\u2013129 (1987)","journal-title":"Soochow J. Math."},{"key":"24_CR9","first-page":"50","volume":"13","author":"D.W. DeTemple","year":"1988","unstructured":"DeTemple, D.W., Robertson, J.M.: Constructions and the realization problem for partition graphs. J. Combin. Inform. System Sci.\u00a013, 50\u201363 (1988)","journal-title":"J. Combin. Inform. System Sci."},{"key":"24_CR10","first-page":"193","volume":"9","author":"D. DeTemple","year":"1984","unstructured":"DeTemple, D., Robertson, J., Harary, F.: Existential partition graphs. J. Combin. Inform. System Sci.\u00a09, 193\u2013196 (1984)","journal-title":"J. Combin. Inform. System Sci."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"30","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks\u00a030, 261\u2013273 (1973)","journal-title":"Networks"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth\u2013Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"24_CR13","unstructured":"Kloks, T., Kratsch, D., Lee, C.M., Liu, J.: Improved bottleneck domination algorithms (2003) (manuscript)"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C., Boland, D.: Representation of finite graphs by a set of intervals on the real line. Fund. Math.\u00a051, 45\u201364 (1962)","journal-title":"Fund. Math."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0012-365X(93)90512-R","volume":"113","author":"K. McAvaney","year":"1993","unstructured":"McAvaney, K., Robertson, J., DeTemple, D.: A characterization and hereditary properties for partition graphs. Discrete Mathematics\u00a0113, 131\u2013142 (1993)","journal-title":"Discrete Mathematics"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0012-365X(85)90117-7","volume":"54","author":"W. Naji","year":"1985","unstructured":"Naji, W.: Reconnaissance des graphes de cordes. Discrete Mathematics\u00a054, 329\u2013337 (1985)","journal-title":"Discrete Mathematics"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.21136\/CPM.1977.117959","volume":"102","author":"L. Nebesk\u00fd","year":"1977","unstructured":"Nebesk\u00fd, L.: On partition graphs and generalizations of line graphs. \u010casopis P\u011bst. Mat.\u00a0102, 203\u2013205 (1977)","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"24_CR18","first-page":"153","volume-title":"Surveys in Combinatorics","author":"N. Robertson","year":"1985","unstructured":"Robertson, N., Seymour, P.D.: Graph minors\u2013A Survey. In: Anderson, I. (ed.) Surveys in Combinatorics, pp. 153\u2013171. Cambridge University Press, Cambridge (1985)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"J.P. Spinrad","year":"1994","unstructured":"Spinrad, J.P.: Recognition of circle graphs. J. Algorithms\u00a016, 264\u2013282 (1994)","journal-title":"J. Algorithms"},{"key":"24_CR20","first-page":"1","volume":"59","author":"S. Tsukiyama","year":"1976","unstructured":"Tsukiyama, S.: Algorithms for generating all maximal independent sets. Electronics & Communications\u00a059, 1\u20138 (1976)","journal-title":"Electronics & Communications"},{"key":"24_CR21","first-page":"311","volume":"18","author":"W.C.-K. Yen","year":"2002","unstructured":"Yen, W.C.-K.: Bottleneck domination and bottleneck independent domination on graphs. Journal of Information Science and Engineering\u00a018, 311\u2013331 (2002)","journal-title":"Journal of Information Science and Engineering"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T06:10:47Z","timestamp":1636351847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}