{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:53Z","timestamp":1725583973556},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_28","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"272-283","source":"Crossref","is-referenced-by-count":1,"title":["On Edge-Independent Sets"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[]},{"given":"Ching-Hao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0095-8956(84)90035-2","volume":"36","author":"M. Albertson","year":"1984","unstructured":"Albertson, M., Collins, K.: Duality and perfection for edges in cliques. Journal of Combinatorial Theory, Series B\u00a036, 298\u2013309 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"2072","DOI":"10.1016\/j.tcs.2009.01.018","volume":"410","author":"L. Alc\u00f3n","year":"2009","unstructured":"Alc\u00f3n, L., Faria, L., de Figueiredo, C., Gutierrez, M.: The complexity of clique graph recognition. Theoretical Computer Science\u00a0410, 2072\u20132083 (2009)","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1016\/j.disc.2011.11.037","volume":"312","author":"P. Anand","year":"2012","unstructured":"Anand, P., Escuadro, H., Gera, R., Hartke, S., Stolee, D.: On the hardness of recognizing triangular line graphs. Discrete Mathematics\u00a0312, 2627\u20132638 (2012)","journal-title":"Discrete Mathematics"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM\u00a041, 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"28_CR5","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. Journal of Combinatorial Theory, Series B\u00a041, 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(82)90149-2","volume":"39","author":"A. Brouwer","year":"1982","unstructured":"Brouwer, A., Rees, G.: More mutually orthogonal Latin squares. Discrete Mathematics\u00a039, 181\u2013263 (1982)","journal-title":"Discrete Mathematics"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S1571-0653(04)00432-9","volume":"13","author":"M. Cerioli","year":"2003","unstructured":"Cerioli, M.: Clique graphs and edge-clique graphs. Electronic Notes in Discrete Mathematics\u00a013, 34\u201337 (2003)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"28_CR8","first-page":"287","volume":"60","author":"M. Cerioli","year":"2001","unstructured":"Cerioli, M., Szwarcfiter, J.: A characterization of edge clique graphs. Ars Combinatorica\u00a060, 287\u2013292 (2001)","journal-title":"Ars Combinatorica"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0012-365X(00)00403-9","volume":"242","author":"M. Cerioli","year":"2002","unstructured":"Cerioli, M., Szwarcfiter, J.: Edge clique graphs and some classes of chordal graphs. Discrete Mathematics\u00a0242, 31\u201339 (2002)","journal-title":"Discrete Mathematics"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.4153\/CJM-1960-017-2","volume":"12","author":"S. Chowla","year":"1960","unstructured":"Chowla, S., Erd\u00f6s, P., Straus, E.: On the maximal number of pairwise orthogonal Latin squares of a given order. Canadian Journal of Mathematics\u00a012, 204\u2013208 (1960)","journal-title":"Canadian Journal of Mathematics"},{"key":"28_CR11","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 Journal on Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M.: Known algorithms for edge clique cover are probably optimal. In: Proceedings SODA 2013, ACM-SIAM, pp. 1044\u20131053 (2013)","DOI":"10.1137\/1.9781611973105.75"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.ejc.2011.12.005","volume":"33","author":"Z. Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D.: Classes of graphs with small rank decompositions are \u03c7-bounded. European Journal of Combinatorics\u00a033, 679\u2013683 (2012)","journal-title":"European Journal of Combinatorics"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"28_CR15","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":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-36065-7_19","volume-title":"WALCOM: Algorithms and Computation","author":"J. Gao","year":"2013","unstructured":"Gao, J., Kloks, T., Poon, S.-H.: Triangle-partitioning edges of planar graphs, toroidal graphs and k-planar graphs. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol.\u00a07748, pp. 194\u2013205. Springer, Heidelberg (2013)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01195325","volume":"9","author":"L. Gargano","year":"1993","unstructured":"Gargano, L., K\u00f6rner, J., Vaccaro, U.: Sperner capacities. Graphs and Combinatorics\u00a09, 31\u201346 (1993)","journal-title":"Graphs and Combinatorics"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(82)90085-1","volume":"41","author":"D.A. Gregory","year":"1982","unstructured":"Gregory, D.A., Pullman, N.J.: On a clique covering problem of Orlin. Discrete Mathematics\u00a041, 97\u201399 (1982)","journal-title":"Discrete Mathematics"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(90)90168-H","volume":"85","author":"A. Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A.: A simple lower bound on edge covering by cliques. Discrete Mathematics\u00a085, 103\u2013104 (1990)","journal-title":"Discrete Mathematics"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejc.2011.09.024","volume":"33","author":"P. Haxell","year":"2012","unstructured":"Haxell, P., Kostoschka, A., Thomass\u00e9, S.: A stability theorem on fractional covering of triangles by edges. European Journal of Combinatorics\u00a033, 799\u2013806 (2012)","journal-title":"European Journal of Combinatorics"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howork","year":"1977","unstructured":"Howork, E.: A characterization of distance-hereditary graphs. The Quarterly Journal of Mathematics\u00a028, 417\u2013420 (1977)","journal-title":"The Quarterly Journal of Mathematics"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A unique tree representation for P\n                  4-sparse graphs. Discrete Applied Mathematics\u00a035, 115\u2013129 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR23","first-page":"71","volume":"11","author":"J. Kong","year":"2009","unstructured":"Kong, J., Wu, Y.: On economical set representations of graphs. Discrete Mathematics and Theoretical Computer Science\u00a011, 71\u201396 (2009)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0012-365X(95)00011-K","volume":"142","author":"J. K\u00f6rner","year":"1995","unstructured":"K\u00f6rner, J.: Intersection number and capacities of graphs. Discrete Mathematics\u00a0142, 169\u2013184 (1995)","journal-title":"Discrete Mathematics"},{"key":"28_CR25","first-page":"1","volume":"56","author":"F. Ma","year":"2013","unstructured":"Ma, F., Zhang, J.: Finding orthogonal Latin squares using finite model searching tools. Science China Information Sciences\u00a056, 1\u20139 (2013)","journal-title":"Science China Information Sciences"},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00373-011-1048-8","volume":"28","author":"S. Lakshmanan","year":"2012","unstructured":"Lakshmanan, S., Bujt\u00e1s, C., Tuza, Z.: Small edge sets meeting all triangles of a graph. Graphs and Combinatorics\u00a028, 381\u2013392 (2012)","journal-title":"Graphs and Combinatorics"},{"key":"28_CR27","doi-asserted-by":"publisher","first-page":"307","DOI":"10.7151\/dmgt.1407","volume":"28","author":"S. Lakshmanan","year":"2008","unstructured":"Lakshmanan, S., Vijayakumar, A.: Clique irreducibility of some iterative classes of graphs. Discussiones Mathematicae Graph Theory\u00a028, 307\u2013321 (2008)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(95)00109-A","volume":"159","author":"V.B. Le","year":"1996","unstructured":"Le, V.B.: Gallai graphs and anti-Gallai graphs. Discrete Mathematics\u00a0159, 179\u2013189 (1996)","journal-title":"Discrete Mathematics"},{"key":"28_CR29","unstructured":"Mujuni, E., Rosamond, F.: Parameterized complexity of the clique partition problem. In: Harland, J., Manyem, P. (eds.) Proceedings CATS 2008. ACS, CRPIT series, vol.\u00a077, pp. 75\u201378 (2008)"},{"key":"28_CR30","unstructured":"Oum, S.: Graphs of bounded rankwidth. PhD thesis, Princeton University (2005)"},{"key":"28_CR31","doi-asserted-by":"publisher","first-page":"6464","DOI":"10.1016\/j.disc.2009.06.016","volume":"309","author":"B. Park","year":"2009","unstructured":"Park, B., Kim, S., Sano, Y.: The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. Discrete Mathematics\u00a0309, 6464\u20136469 (2009)","journal-title":"Discrete Mathematics"},{"key":"28_CR32","series-title":"Pitman Research Notes in Mathematics Series","volume-title":"Graph dynamics","author":"E. Prisner","year":"1995","unstructured":"Prisner, E.: Graph dynamics. Pitman Research Notes in Mathematics Series. Longman, Essex (1995)"},{"key":"28_CR33","first-page":"197","volume":"67","author":"A. Raychaudhuri","year":"1988","unstructured":"Raychaudhuri, A.: Intersection number and edge clique graphs of chordal and strongly chordal graphs. Congressus Numerantium\u00a067, 197\u2013204 (1988)","journal-title":"Congressus Numerantium"},{"key":"28_CR34","first-page":"269","volume":"32","author":"A. Raychaudhuri","year":"1991","unstructured":"Raychaudhuri, A.: Edge clique graphs of some important classes of graphs. Ars Combinatoria\u00a032, 269\u2013278 (1991)","journal-title":"Ars Combinatoria"},{"key":"28_CR35","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(74)90148-4","volume":"9","author":"R. Wilson","year":"1974","unstructured":"Wilson, R.: Concerning the number of mutually orthogonal Latin squares. Discrete Mathematics\u00a09, 181\u2013198 (1974)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:19:25Z","timestamp":1557717565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}