Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
type: Item
instance of: scholarly article
title: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
zbMATH Open document ID: 0473.05049
DOI: 10.1016/0012-365X(81)90218-1
author: S. H. Smith
published in: Discrete Mathematics
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3741447
zbMATH Keywords: clique cover
MaRDI profile type: Publication
cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: How To Color Claw-Free Perfect Graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
cites work: Q4770411
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
full work available at URL: 0012-365x(81)90218-1
OpenAlex ID: W2000335885
description: scientific article; zbMATH DE number 3741447