A nice class for the vertex packing problem

DOI10.1016/S0166-218X(96)00114-XzbMath0879.05058MaRDI QIDQ1363736

Anna Galluccio, Paola Bertolazzi, Caterina De Simone

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

substitution; vertex packing; Homogeneous sets

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting given length cycles
• 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é
• Some simplified NP-complete graph problems
• On the vertex packing problem
• Finding a Minimum Circuit in a Graph