Spanning trees with at most 4 leaves in K 1 , 5 -free graphs

Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh

Source record

Source: Crossref

Published: Aug 1, 2019

DOI: 10.1016/j.disc.2019.05.005

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.