Determining connectedness from subdigraphs (Q2562869): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On nonreconstructable tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5544087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5515142 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the problem of reconstructing a tournament from subtournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstructing the degree pair sequence of a digraph / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:22, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Determining connectedness from subdigraphs |
scientific article |
Statements
Determining connectedness from subdigraphs (English)
0 references
1974
0 references