Indexed metadata

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures

James H. Schmerl, William T. Trotter

Source record

Source: Crossref

Published: Apr 1, 1993

DOI: 10.1016/0012-365x(93)90516-v

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.

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures — Mathematical Frontier Network