Randomly hamiltonian digraphs

DOI10.4064/FM-65-2-223-226MaRDI QIDQ5571622zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, H. V. Kronk, Don R. Lick

Publication date 1969

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/214106

zbMATH Keywords

topology

Cited in

(7)

• Greedily constructing maximal partial f-factors
• Randomly n-cyclic digraphs
• On randomly n-cyclic digraphs
• Path coverings of the vertices of a tree
• scientific article; zbMATH DE number 4145958 (Why is no real title available?)
• scientific article; zbMATH DE number 4068925 (Why is no real title available?)
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

This page was built for publication: Randomly hamiltonian digraphs

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