The superstar packing problem

DOI10.1007/S00493-009-1986-4OpenAlexW1968008035MaRDI QIDQ2149487FDOQ2149487

Authors: Marek Janata, Jácint Szabó 

Publication date: 29 June 2022

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-009-1986-4

Recommendations

• On star family packing of graphs
• scientific article; zbMATH DE number 5999574
• Oriented star packings
• scientific article; zbMATH DE number 568827
• Packings by Complete Bipartite Graphs

Mathematics Subject Classification ID

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

Cites Work

• On the Complexity of General Graph Factor Problems
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• Packing subgraphs in a graph
• The factorization of graphs. II
• Title not available (Why is that?)
• An extension of matching theory
• On matroids induced by packing subgraphs
• An extension of Tutte's 1-factor theorem
• Efficient subgraphs packing
• The k‐piece packing problem

Cited In (4)

• On star family packing of graphs
• On rooted packings, decompositions, and factors of graphs
• Oriented star packings
• Packing $k$-Matchings and $k$-Critical Graphs

This page was built for publication: The superstar packing problem

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