A NICE CLASS FOR THE VERTEX PACKING PROBLEM

Authors
BERTOLAZZI P DESIMONE C GALLUCCIO A
Citation
P. Bertolazzi et al., A NICE CLASS FOR THE VERTEX PACKING PROBLEM, Discrete applied mathematics, 76(1-3), 1997, pp. 3-19
Citations number
14
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
76
Issue
1-3
Year of publication
1997
Pages
3 - 19
Database
ISI
SICI code
Abstract
A class C of graphs for which the vertex packing problem can be solve d in polynomial time is described. Graphs in C can be obtained from b ipartite graphs and claw-free graphs by repeated substitutions. A forb idden subgraphs characterization of the class C is given.