Block allocation of a sequential resource

DOI10.26493/1855-3974.1508.F8CMaRDI QIDQ5217060zbMATH OpenOpenAlexWikidataFDO

Authors 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) Asymptotic enumeration (05A16) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Random packings of graphs
• Packing graphs: The packing problem solved
• scientific article; zbMATH DE number 1300357
• Packing in honeycomb networks
• Packing of hexagonal networks

Cites work

• An introduction to matching polynomials
• Chain hexagonal cacti: matchings and independent sets
• Counting maximal matchings in linear polymers
• Graph theory
• scientific article; zbMATH DE number 3171475 (Why is no real title available?)
• scientific article; zbMATH DE number 5717196 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Matching theory
• Packing 3-vertex paths in claw-free graphs and related topics
• Packing three-vertex paths in a subcubic graph
• Random parking, sequential adsorption, and the jamming limit
• Sandwiching saturation number of fullerene graphs
• Saturation number of fullerene graphs

Cited in

(11)

• scientific article; zbMATH DE number 2114513 (Why is no real title available?)
• Smallest maximal matchings of graphs
• A renewal approach to configurational entropy in one dimension
• On the structure factor of jammed particle configurations on the one-dimensional lattice
• Tilings of a honeycomb strip and higher order Fibonacci numbers
• On a variant of Flory model
• Complexity function of jammed configurations of Rydberg atoms
• A model of random sequential adsorption on a ladder graph
• Dominating induced matchings and other graph parameters
• Minimum maximal matchings in phenylene chains
• Packing stars in fullerenes

Describes a project that uses

Uses Software

• OEIS

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

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