Title of article :
A nice class for the vertex packing problem Original Research Article
Author/Authors :
Paola Bertolazzi، نويسنده , , Caterina De Simone، نويسنده , , Anna Galluccio، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Abstract :
A class B∗ of graphs for which the vertex packing problem can be solved in polynomial time is described. Graphs in B∗ can be obtained from bipartite graphs and claw-free graphs by repeated substitutions. A forbidden subgraphs characterization of the class B∗ is given.
Keywords :
Vertex packing , Homogeneous sets , Substitution
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
