Randomly Traceable Graphs

DOI10.1137/0116056MaRDI QIDQ5549652zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, H. V. Kronk

Publication date 1968

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0116056

zbMATH Keywords

topology

Cited in

(21)

• Greedily constructing maximal partial f-factors
• Edge sets contained in circuits
• Path coverings of the vertices of a tree
• On separating cycles in graphs
• Spanning trees with pairwise nonadjacent endvertices
• Randomly planar graphs
• On randomly Hamiltonian graphs
• On k-path Hamiltonian graphs and line-graphs
• Graphs in which every finite path is contained in a circuit
• scientific article; zbMATH DE number 4145958 (Why is no real title available?)
• scientific article; zbMATH DE number 4164912 (Why is no real title available?)
• Randomly Near-Traceable Graphs
• scientific article; zbMATH DE number 4068925 (Why is no real title available?)
• Randomly k-axial graphs
• On randomly 3-axial graphs
• scientific article; zbMATH DE number 90530 (Why is no real title available?)
• Hamiltonian extension
• A parameterized complexity analysis of bounded height depth-first search trees
• Extending cycles in graphs
• Randomly H-coverable graphs
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

This page was built for publication: Randomly Traceable Graphs

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