scientific article; zbMATH DE number 7815491

MaRDI QIDQ6152274

Unnamed Author

Publication date: 11 March 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

modular decompositioninduced matching\(k\)-independent setgraph 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

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

This page was built for publication: