A nice class for the vertex packing problem
From MaRDI portal
Publication:1363736
DOI10.1016/S0166-218X(96)00114-XzbMATH Open0879.05058OpenAlexW1986815960MaRDI QIDQ1363736FDOQ1363736
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Matching theory
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding and counting given length cycles
- Some simplified NP-complete graph problems
- On maximal independent sets of vertices in claw-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding a Minimum Circuit in a Graph
- Bull-free Berge graphs are perfect
- On the vertex packing problem
Cited In (10)
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- On variations of \(P_{4}\)-sparse graphs
- Extension of hereditary classes with substitutions
- New applications of clique separator decomposition for the maximum weight stable set problem
- Independent domination in finitely defined classes of graphs
- All minimal prime extensions of hereditary classes of graphs
- Algorithm for the vertex packing problem
- Basic perfect graphs and their extensions
- Minimum cost and list homomorphisms to semicomplete digraphs
- A finiteness theorem for primal extensions
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)
