Existence of spanning and dominating trails and circuits

H.J. Veldman

Research output: Contribution to journalArticleAcademic

10 Citations (Scopus)
165 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)23-31
JournalJournal of graph theory
Issue number1
Publication statusPublished - 1986


  • IR-70814


Dive into the research topics of 'Existence of spanning and dominating trails and circuits'. Together they form a unique fingerprint.

Cite this