The maximum weight (\K₁,K₂\,k,l)-packing problem in a graph

MaRDI QIDQ6152274FDOQ6152274

Authors:

Publication date: 11 March 2024

Full work available at URL: https://vestifm.belnauka.by/jour/article/view/711

Recommendations

• scientific article; zbMATH DE number 7743715
• Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
• Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
• Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
• $$\{k\}$$-Packing Functions of Graphs

zbMATH Keywords

modular decomposition\(k\)-independent setinduced matchinggraph packing\(k\)-packing

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)

Cites Work

• Transitiv orientierbare Graphen
• Title not available (Why is that?)
• Relations between packing and covering numbers of a tree
• On packing and covering numbers of graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• On distance-3 matchings and induced matchings
• Combinatorial and computational aspects of graph packing and graph decomposition
• The complexity of dissociation set problems in graphs
• On minimum maximal distance-\(k\) matchings
• Equality of distance packing numbers

This page was built for publication: The maximum weight \((\{K_1,K_2\},k,l)\)-packing problem in a graph

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