On traceable powers of digraphs

DOI10.1016/S0012-365X(99)00213-7zbMath0940.05034OpenAlexW2056388902WikidataQ128089516 ScholiaQ128089516MaRDI QIDQ1970584

Antoni Marczyk, Günter Schaar

Publication date: 13 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00213-7

zbMATH Keywords

digraphdistancepowerindependence numbertraceabilityhamiltonian cyclehamiltonian pathstrongly connectedness

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: On traceable powers of digraphs