Clique covering and clique partition in generalizations of line graphs

DOI10.1016/0166-218X(94)00076-PzbMath0810.05062MaRDI QIDQ1343162

Erich Prisner

Publication date: 1 February 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

clique partitionline graphscliques covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Fast constructive and improvement heuristics for edge clique covering

Cites Work

• Unnamed Item
• Unnamed Item
• Applications of edge coverings by cliques
• On clique partitions of split graphs
• Clique Covering of Graphs IV. Algorithms
• On the tree representation of chordal graphs
• The NP-Completeness of Some Edge-Partition Problems
• A New Algorithm for Generating All the Maximal Independent Sets
• A Property of Infinite Products of Boolean Matrices
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Clique covering and clique partition in generalizations of line graphs