Indexed metadata

An upper bound on the domination number of n -vertex connected cubic graphs

A.V. Kostochka, B.Y. Stodolsky

Source record

Source: Crossref

Published: Mar 1, 2009

DOI: 10.1016/j.disc.2007.12.009

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.

An upper bound on the domination number of n -vertex connected cubic graphs — Mathematical Frontier Network