Indexed metadata

A polynomial time algorithm for strong edge coloring of partial k-trees

Mohammad R. Salavatipour

Source record

Source: Crossref

Published: Sep 1, 2004

DOI: 10.1016/j.dam.2004.03.001

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.

A polynomial time algorithm for strong edge coloring of partial k-trees — Mathematical Frontier Network