CLIQUE COVERING AND CLIQUE PARTITION IN GENERALIZATIONS OF LINE GRAPHS

Authors
PRISNER E
Citation
E. Prisner, CLIQUE COVERING AND CLIQUE PARTITION IN GENERALIZATIONS OF LINE GRAPHS, Discrete applied mathematics, 56(1), 1995, pp. 93-98
Citations number
11
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
56
Issue
1
Year of publication
1995
Pages
93 - 98
Database
ISI
SICI code
Abstract
Cliques are complete subgraphs of a graph. In this note we show that m inimum sets of maximal cliques covering, respectively partitioning the edge set of a graph can be computed efficiently for certain superclas ses of the class of line graphs.