Randomly Traceable Graphs
From MaRDI portal
Publication:5549652
DOI10.1137/0116056zbMath0164.54202MaRDI QIDQ5549652
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
Related Items
Hamiltonian Extension, Extending cycles in graphs, Randomly H-coverable graphs, Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests, 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, Unnamed Item, Unnamed Item, Unnamed Item, Randomly Near-Traceable Graphs, Randomly k-axial graphs, Unnamed Item, On randomly 3-axial graphs