This note supplements an earlier paper of this author, in which the concept of a strong k-hypomorphism between two graphs was defined (Thatte, 1990, Section VI). For k = 1, this is just a hypomorphism. Here it is proved that strongly k-hypomorphic graphs and strongly k-edge hypomorphic directed grap
✦ LIBER ✦
A note on the line reconstruction problem
✍ Scribed by L Lovász
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 90 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On a reconstruction problem
✍
Bhalchandra D. Thatte
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 86 KB
A note on line digraphs and the directed
✍
V. Chvátal; C. Ebenegger
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 365 KB
Note: Two rendezvous search problems on
✍
Vic Baston
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 28 KB
👁 1 views
A new upper bound is obtained for the two-person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions an
A note on justification and reconstructi
✍
Herbert Feigl
📂
Article
📅
1958
🏛
Springer Netherlands
🌐
English
⚖ 194 KB
A Note on the Stockhausen Problem
✍
Ronald C. Read; Lily Yen
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 295 KB
We consider problems in the enumeration of sequences suggested by the problem of determining the number of ways of performing a piano composition (Klavierstu ck XI) by Karlheinz Stockhausen.
A note on the complementarity problem
✍
C. B. Garcia
📂
Article
📅
1977
🏛
Springer
🌐
English
⚖ 83 KB