Skip to main content

Finding minimum clique capacity

Author(s): Chudnovsky, Maria; Oum, Sang-il; Seymour, Paul D.

To refer to this page use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChudnovsky, Maria-
dc.contributor.authorOum, Sang-il-
dc.contributor.authorSeymour, Paul D.-
dc.identifier.citationChudnovsky, Maria, Oum, Sang-Il, Seymour, Paul. (2012). Finding minimum clique capacity. COMBINATORICA, 32 (283 - 287. doi:10.1007/s00493-012-2891-9en_US
dc.description.abstractLet C be a clique of a graph G. The capacity of C is defined to be (|V (G)\textbackslashC|+|D|)/2, where D is the set of vertices in V (G)\textbackslashC that have both a neighbour and a non-neighbour in C. We give a polynomial-time algorithm to find the minimum clique capacity in a graph G. This problem arose in the study [1] of packing vertex-disjoint induced three-vertex paths in a graph with no stable set of size three, which in turn was motivated by Hadwiger’s conjecture.en_US
dc.format.extent283 - 287en_US
dc.rightsAuthor's manuscripten_US
dc.titleFinding minimum clique capacityen_US
dc.typeJournal Articleen_US

Files in This Item:
File Description SizeFormat 
cliquecap.pdf58.86 kBAdobe PDFView/Download

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.