Abstract
The work in this paper extends and generalizes earlier work by Ore on arbitrarily traceable Euler graphs, by Harary on arbitrarily traceable digraphs, by Chartrand and White on randomly n-traversable graphs, and by Chartrand and Lick on randomly Eulerian digraphs. Arbitrarily traceable graphs of mixed type are defined and characterized in terms of a class of forbidden graphs. Arbitrarily traceable digraphs of mixed type are also defined and a simply applied characterization is given for them.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
