Existence of spanning and dominating trails and circuits


Veldman, H.J. (1986) Existence of spanning and dominating trails and circuits. Journal of Graph Theory, 10 (1). pp. 23-31. ISSN 0364-9024

open access
Abstract:Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. T is a dominating trail (D-trail) if every edge of G is incident with at least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of vertices or edges are derived for graphs to have an S-trail, S-circuit, D-trail, or D-circuit. Thereby a result of Brualdi and Shanny and one mentioned by Lesniak-Foster and Williamson are improved.
Item Type:Article
Copyright:© 1986 Wiley InterScience
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/70814
Official URL:https://doi.org/10.1002/acs.941
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page