Path node-covering constants for certain families of trees

DOI10.1017/S0305004100055328zbMath0395.05027OpenAlexW1998618218MaRDI QIDQ4177593

A. Meir, John W. Moon

Publication date: 1978

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100055328

zbMATH Keywords

Path Node-Covering Constants for Certain Families of Trees

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Analysis of three graph parameters for random trees

Cites Work

• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The number of trees
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• Packing and covering constants for certain families of trees. I
• Packing and Covering Constants for Certain Families of Trees. II

This page was built for publication: Path node-covering constants for certain families of trees