Path node-covering constants for certain families of trees

DOI10.1017/S0305004100055328MaRDI QIDQ4177593zbMATH OpenOpenAlexFDO

Authors A. Meir, J. 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

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

Cites work

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

Cited in

(1)

• Analysis of three graph parameters for random trees

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

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