Block allocation of a sequential resource

DOI10.26493/1855-3974.1508.f8czbMath1433.05258OpenAlexW2953064927WikidataQ127630541 ScholiaQ127630541MaRDI QIDQ5217060

Tomislav Došlić

Publication date: 21 February 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1508.f8c

zbMATH Keywords

maximal matchingmaximal packing

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Asymptotic enumeration (05A16) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Packing stars in fullerenes ⋮ Smallest maximal matchings of graphs ⋮ A renewal approach to configurational entropy in one dimension

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing 3-vertex paths in claw-free graphs and related topics
• Saturation number of fullerene graphs
• Chain hexagonal cacti: matchings and independent sets
• Matching theory
• An introduction to matching polynomials
• Counting maximal matchings in linear polymers
• Sandwiching saturation number of fullerene graphs
• Random parking, sequential adsorption, and the jamming limit

This page was built for publication: Block allocation of a sequential resource