Title of article
Clique covering and clique partition in generalizations of line graphs
Author/Authors
Erich Prisner، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
6
From page
93
To page
98
Abstract
Cliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal cliques covering, respectively partitioning the edge set of a graph can be computed efficiently for certain superclasses of the class of line graphs.
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884153
Link To Document