𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mixed problem with involution on a two-edge graph containing a cycle

✍ Scribed by M. Sh. Burlutskaya


Book ID
118725279
Publisher
SP MAIK Nauka/Interperiodica
Year
2012
Tongue
English
Weight
413 KB
Volume
86
Category
Article
ISSN
1064-5624

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graphs such that every two edges are con
✍ Nathalie Homobono; Claudine Peyrat πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 665 KB

A graph G is said to have depth 6 if every path of length d + 1 is contained in a shortest cycle. First we answer by the negative a problem of Neumaier [2], by constructing for every 6, a graph of depth 6 which is neither a cyck nor a uniform subdivision of another graph. Then we characterize the gr

A search problem on graphs which general
✍ Thomas Andreae πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 499 KB

A search problem on graphs which generalizes some group testing problems with two defectives, Discrete Mathematics 88 (1991) 121-127. We consider a search problem which generalizes the group testing problems previously studied in papers of Chang/Hwang and Chang/Hwang/Lin. In its general form for a