On the vertex packing problem

DOI10.1007/BF01195324zbMath0781.05041OpenAlexW2117510496MaRDI QIDQ2366214

Yanyan Li

Publication date: 29 June 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195324

zbMATH Keywords

vertex packing problemsubgraphs characterization

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) Structural characterization of families of graphs (05C75)

Related Items (20)

New classes of Berge perfect graphs ⋮ Complexity of list coloring problems with a fixed total number of colors ⋮ On independent vertex sets in subclasses of apple-free graphs ⋮ Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs ⋮ A nice class for the vertex packing problem ⋮ On the use of Boolean methods for the computation of the stability number ⋮ All minimal prime extensions of hereditary classes of graphs ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ Bounding the Clique-Width of H-free Chordal Graphs ⋮ Portfolio optimization through a network approach: network assortative mixing and portfolio diversification ⋮ Independent domination in finitely defined classes of graphs ⋮ Stability number of bull- and chair-free graphs revisited ⋮ On the structure of (pan, even hole)‐free graphs ⋮ On the structure and stability number of \(P_{5}\)- and co-chair-free graphs ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Independent domination in finitely defined classes of graphs: polynomial algorithms ⋮ Stability number of bull- and chair-free graphs ⋮ A finiteness theorem for primal extensions ⋮ The Maximum Independent Set Problem in Planar Graphs ⋮ Extension of hereditary classes with substitutions

Cites Work

• The struction of a graph: Application to CN-free graphs
• Matching theory
• Bull-free Berge graphs are perfect
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Stability number of bull- and chair-free graphs
• Some simplified NP-complete graph problems
• On a property of the class of n-colorable graphs
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
• Unnamed Item
• Unnamed Item

This page was built for publication: On the vertex packing problem