Indexed metadata

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

Aung Kyaw

Source record

Source: Crossref

Published: Oct 1, 2009

DOI: 10.1016/j.disc.2009.04.023

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.

Spanning trees with at most 3 leaves in K 1 , 4 -free graphs — Mathematical Frontier Network