Characterizations and Constructions of Minimally 2-Connected Graphs and Minimally Strong Digraphs.
Abstract
The report presents one short inductive proof which characterizes, by construction, both the minimally 2-connected graphs and the minimally strong digraphs. Several operations are given which can be used to construct minimally strong digraphs from other minimally strong digraphs and then, by straightforward modifications, these operations are shown to construct minimally 2-connected graphs from other minimally 2-connected graphs. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1970
- Accession Number
- AD0714815
Entities
People
- Stephen Hedetniemi
Organizations
- University of Iowa