Randomly Traceable Graphs
From MaRDI portal
Publication:5549652
DOI10.1137/0116056zbMath0164.54202OpenAlexW1983018122MaRDI 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
Randomly Near-Traceable Graphs, Spanning trees with pairwise nonadjacent endvertices, Randomly planar graphs, Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests, Edge sets contained in circuits, Randomly k-axial graphs, Path coverings of the vertices of a tree, On separating cycles in graphs, Extending cycles in graphs, Unnamed Item, Greedily constructing maximal partial \(f\)-factors, Unnamed Item, 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, Hamiltonian Extension, Randomly H-coverable graphs, On randomly 3-axial graphs, Unnamed Item
