- Title
- On 2-walks in chordal planar graphs
- Creator
- Teska, Jakub
- Date
- 2009
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60955
- Identifier
- vital:1950
- Identifier
-
https://doi.org/10.1016/j.disc.2008.11.027
- Identifier
- ISSN:0012-365X
- Abstract
- A 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said to be chordal if each cycle different from a 3-cycle has a chord. We prove that every chordal planar graph G with toughness t (G) > frac(3, 4) has a 2-walk. © 2008 Elsevier B.V. All rights reserved.
- Relation
- Discrete Mathematics Vol. 309, no. 12 (2009), p. 4017-4026
- Rights
- Copyright Elsevier
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 2-walk; Chordal planar graph; Toughness; Spanning trails
- Reviewed
- Hits: 418
- Visitors: 395
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|