{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:00:38Z","timestamp":1648792838056},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00373-011-1047-9","type":"journal-article","created":{"date-parts":[[2011,4,30]],"date-time":"2011-04-30T16:57:48Z","timestamp":1304182668000},"page":"347-364","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Sun in Building-Free Graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Elaine M.","family":"Eschen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy P.","family":"Spinrad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sritharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,1]]},"reference":[{"key":"1047_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon N., Yuster R., Zwick U.: Finding and counting given length cycles. Algorithmica 17, 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"1047_CR2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt H.-J., Mulder H.M.: Distance-hereditary graphs. J. Combin. Theory B 41, 182\u2013208 (1986)","journal-title":"J. Combin. Theory B"},{"key":"1047_CR3","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 (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"1047_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0304-0208(08)72923-2","volume-title":"Topics on Perfect Graphs","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal V.: Perfectly ordered graphs. In: Berge, C., Chv\u00e1tal, V. (eds) Topics on Perfect Graphs, pp. 63\u201365. North-Holland, Amsterdam (1984)"},{"key":"1047_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25, 71\u201376 (1961)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"1047_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0166-218X(99)00149-3","volume":"99","author":"F. Dragan","year":"2000","unstructured":"Dragan F.: Strongly orderable graphs: a common generalization of strongly chordal and chordal bipartite graphs. Discret. Appl. Math. 99, 427\u2013442 (2000)","journal-title":"Discret. Appl. Math."},{"key":"1047_CR7","unstructured":"Dragan, F., Nicolai, F.: LexBFS-orderings of distance-hereditary graphs. Schriftenreihe des Fachbereichs Mathematik der Universit\u00e4t Duisburg, Duisburg, Germany, SM-DU-303 (1995)"},{"key":"1047_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s00373-007-0706-3","volume":"23","author":"E.M. Eschen","year":"2007","unstructured":"Eschen E.M., Ho\u00e0ng C.T., Sritharan R.: An O(n 3)-time recognition algorithm for hhds-free graphs. Graphs Comb. 23, 209\u2013231 (2007)","journal-title":"Graphs Comb."},{"key":"1047_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"Farber M.: Characterizations of strongly chordal graphs. Discret. Math. 43, 173\u2013189 (1983)","journal-title":"Discret. Math."},{"key":"1047_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"1047_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P.L. Hammer","year":"1990","unstructured":"Hammer P.L., Maffray F.: Completely separable graphs. Discret. Appl. Math 27, 85\u201399 (1990)","journal-title":"Discret. Appl. Math"},{"key":"1047_CR12","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1137\/080729281","volume":"23","author":"C.T. Ho\u00e0ng","year":"2010","unstructured":"Ho\u00e0ng C.T.: On the complexity of finding a sun in a graph. SIAM J. Discret. Math. 23, 2156\u20132162 (2010)","journal-title":"SIAM J. Discret. Math."},{"key":"1047_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/jgt.3190120310","volume":"12","author":"C.T. Ho\u00e0ng","year":"1988","unstructured":"Ho\u00e0ng C.T., Khouzam N.: On brittle graphs. J. Graph Theory 12, 391\u2013404 (1988)","journal-title":"J. Graph Theory"},{"key":"1047_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0304-3975(00)00005-0","volume":"259","author":"C.T. Ho\u00e0ng","year":"2001","unstructured":"Ho\u00e0ng C.T., Sritharan R.: Finding houses and holes in graphs. Theor. Comput. Sci. 259, 233\u2013244 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"1047_CR15","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing hhds-free graphs. In: Proceedings of the 31st International Workshop on Graph Theoretic Concepts in Computer Science (WG 2005). Metz, France (2005)","DOI":"10.1007\/11604686_40"},{"key":"1047_CR16","first-page":"65","volume":"8","author":"S.D. Nikolopoulos","year":"2006","unstructured":"Nikolopoulos S.D., Palios L.: Recognizing hh-free, hhd-free, and Welsh-Powell opposition graphs. Discret. Math. Theor. Comput. Sci. 8, 65\u201382 (2006)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"1047_CR17","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige R., Tarjan R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"1047_CR18","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose D.J., Tarjan R.E., Leuker G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"1047_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"J.P. Spinrad","year":"1993","unstructured":"Spinrad J.P.: Doubly lexical ordering of dense 0\/1 matrices. Inf. Process. Lett. 45, 229\u2013235 (1993)","journal-title":"Inf. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1047-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1047-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1047-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T07:54:11Z","timestamp":1560153251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1047-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["1047"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1047-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,1]]}}}