Graphs such that every two edges are contained in a shortest cycle (Q1122590)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs such that every two edges are contained in a shortest cycle |
scientific article; zbMATH DE number 4106892
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs such that every two edges are contained in a shortest cycle |
scientific article; zbMATH DE number 4106892 |
Statements
Graphs such that every two edges are contained in a shortest cycle (English)
0 references
1989
0 references
The authors characterize the graphs in which every two edges are in a shortest cycle. These graphs are the uniform subdivisions of the regular or semi-regular graphs of diameter d and girth 2d or of the multigraphs on two vertices. They also investigate the graphs in which every path of length m is contained in a shortest cycle and show that these graphs do not have a similar characterization.
0 references
shortest cycle
0 references
