On traceable powers of digraphs

DOI10.1016/S0012-365X(99)00213-7MaRDI QIDQ1970584zbMATH OpenOpenAlexWikidataFDO

Authors 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

digraphdistancehamiltonian cyclehamiltonian pathindependence numberpowerstrongly connectednesstraceability

Mathematics Subject Classification ID

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

Recommendations

• On expansions and extensions of powerful digraphs
• Power on digraphs
• On traceable and upper traceable numbers of graphs.
• On Hamiltonian powers of digraphs
• Traces of hypergraphs
• On the tree structure of the power digraphs modulo n.
• Homomorphisms to powers of digraphs
• scientific article; zbMATH DE number 917837
• Domination number and traceability of graphs
• scientific article; zbMATH DE number 3849274

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970584)