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
β¦ 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
On the equiconvergence of eigenfunction
β
M. Sh. Burlutskaya; A. P. Khromov
π
Article
π
2007
π
Springer
π
English
β 321 KB
A note on two problems in connexion with
β
E. W. Dijkstra
π
Article
π
1959
π
Springer-Verlag
π
English
β 136 KB
Graphs That Do Not Contain a Cycle with
β
Aboulker, Pierre; RadovanoviΔ, Marko; Trotignon, Nicolas; VuΕ‘koviΔ, Kristina
π
Article
π
2012
π
Society for Industrial and Applied Mathematics
π
English
β 304 KB
On graphs with a large chromatic number
β
S. L. Berlov, I. I. Bogdanov
π
Article
π
2012
π
Springer US
π
English
β 260 KB
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