Between packable and arbitrarily packable graphs: Packer-spoiler games

MaRDI QIDQ2768120zbMATH OpenFDO

Authors Wayne Goddard, Grzegorz Kubicki

Publication date 30 January 2002

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

NP-hard\(F\)-packingpacker-spoiler game

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1300357
• Efficient graph packing via game colouring
• Packings in complete graphs
• scientific article; zbMATH DE number 5665909
• On packable digraphs
• Packing graphs in their complements
• On the packing numbers in graphs
• Some results on packing graphs in their complements
• scientific article; zbMATH DE number 1409232
• Packing graphs of bounded codegree

Cited in

(1)

• The generalized matcher game

This page was built for publication: Between packable and arbitrarily packable graphs: Packer-spoiler games

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