Record conditions for cycling
β Scribed by Snow, Jonathan E.; Drela, Mark
- Book ID
- 109789960
- Publisher
- Nature Publishing Group
- Year
- 1994
- Tongue
- English
- Weight
- 126 KB
- Volume
- 371
- Category
- Article
- ISSN
- 0028-0836
- DOI
- 10.1038/371552d0
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We first review the matrix completion problem that motivated cycle completable graphs. We then discuss prior and give new structural characterizations of these graphs, along with their relationship to chordal and series-parallel graphs. The concept of cycle completable 9raph is introduced in [2] as
## Abstract A cycle __C__ of a graph __G__ is dominating if each component of $G\backslash C$ is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3βconnected graph to be a dominating cycle. Β© 2005 Wiley Periodicals, Inc. J Graph Theory