On graphs without a C4 or a diamond Export

@article{citeulike:5847396, abstract = {We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4, diamond)-free graph and the number of n-vertex, labeled (C4, diamond)-free graphs. We also give an efficient algorithm for finding a largest clique in the more general class of (house, diamond)-free graphs.}, archivePrefix = {arXiv}, author = {Eschen, Elaine M. and Hoang, Chinh T. and Spinrad, Jeremy P. and Sritharan, R.}, citeulike-article-id = {5847396}, citeulike-linkout-0 = {http://arxiv.org/abs/0909.4719}, citeulike-linkout-1 = {http://arxiv.org/pdf/0909.4719}, day = {25}, eprint = {0909.4719}, keywords = {algorithm, article, clique, diamond, graphtheory}, month = {Sep}, posted-at = {2009-09-28 18:00:29}, priority = {2}, title = {On graphs without a C4 or a diamond}, url = {http://arxiv.org/abs/0909.4719}, year = {2009} }

TY - JOUR ID - citeulike:5847396 L3 - citeulike-article-id:5847396 N2 - We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4, diamond)-free graph and the number of n-vertex, labeled (C4, diamond)-free graphs. We also give an efficient algorithm for finding a largest clique in the more general class of (house, diamond)-free graphs. TI - On graphs without a C4 or a diamond KW - algorithm KW - article KW - clique KW - diamond KW - graphtheory AU - Eschen, Elaine AU - Hoang, Chinh AU - Spinrad, Jeremy AU - Sritharan, R PY - 2009/Sep/25/ UR - http://arxiv.org/abs/0909.4719 ER -