A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns

DOI10.1016/0166-218X(95)00014-IzbMATH Open0848.05059OpenAlexW1980243461MaRDI QIDQ1917331FDOQ1917331

Frank Harary, William C. Randolph, Paul G. Mezey

Publication date: 4 August 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00014-i

Recommendations

• Maximal independent sets in caterpillar graphs
• Counting circular caterpillars
• scientific article; zbMATH DE number 2000290
• Spanning caterpllars with bounded diameter
• Caterpillar tolerance representations of cycles

zbMATH Keywords

adsorptionmoleculescaterpillar

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Parallel concepts in graph theory
• The number of caterpillars

Cited In (4)

• Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
• Title not available (Why is that?)
• A literature review on circle and sphere packing problems: models and methodologies
• Evolutionary computation solutions to the circle packing problem

This page was built for publication: A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns

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