A nice class for the vertex packing problem

DOI10.1016/S0166-218X(96)00114-XMaRDI QIDQ1363736zbMATHOpenAlexFDO

Authors P. Bertolazzi, Caterina De Simone, A. Galluccio

Publication date 22 December 1997

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

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

substitutionvertex packingHomogeneous sets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the vertex packing problem
• Extension of hereditary classes with substitutions
• Basic perfect graphs and their extensions
• Packings by cliques and by finite families of graphs
• On the closure of graphs under substitution

Cites work

• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Bull-free Berge graphs are perfect
• Finding a Minimum Circuit in a Graph
• Finding and counting given length cycles
• Graph theory
• Matching theory
• On maximal independent sets of vertices in claw-free graphs
• On the vertex packing problem
• Some simplified NP-complete graph problems

Cited in

(10)

• New applications of clique separator decomposition for the maximum weight stable set problem
• All minimal prime extensions of hereditary classes of graphs
• Minimum cost and list homomorphisms to semicomplete digraphs
• On variations of \(P_{4}\)-sparse graphs
• A finiteness theorem for primal extensions
• Independent domination in finitely defined classes of graphs
• Algorithm for the vertex packing problem
• Independent sets of maximum weight in (\(p,q\))-colorable graphs.
• Basic perfect graphs and their extensions
• Extension of hereditary classes with substitutions

This page was built for publication: A nice class for the vertex packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363736)