Clique covering and clique partition in generalizations of line graphs
type: Item
instance of: scholarly article
title: Clique covering and clique partition in generalizations of line graphs
zbMATH Open document ID: 0810.05062
DOI: 10.1016/0166-218X(94)00076-P
author: Erich Prisner
published in: Discrete Applied Mathematics
publication date: 1995-02-01T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 716338
zbMATH Keywords: clique partition
zbMATH Keywords: cliques covering
zbMATH Keywords: line graphs
MaRDI profile type: Publication
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q4152571
cites work: A Property of Infinite Products of Boolean Matrices
cites work: Clique Covering of Graphs IV. Algorithms
cites work: Applications of edge coverings by cliques
cites work: On the tree representation of chordal graphs
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: On clique partitions of split graphs
cites work: Q3980562
Recommended article: Clique coverings and partitions of line graphs
Recommended article: Clique partitions and clique coverings
Recommended article: On the number of distinct minimal clique partitions and clique covers of a line graph
Recommended article: On clique coverings of complete multipartite graphs
Recommended article: Clique covering of graphs
Recommended article: Q3944641
Recommended article: Q4014438
Recommended article: Q3035328
Recommended article: Q5284090
Recommended article: Q5150561
description: scientific article; zbMATH DE number 716338