Randomly Traceable Graphs

Abstract

Previous article Next article Randomly Traceable GraphsGary Chartrand and Hudson V. KronkGary Chartrand and Hudson V. Kronkhttps://doi.org/10.1137/0116056PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout Previous article Next article FiguresRelatedReferencesCited ByDetails Hamiltonian ExtensionGraph Theory | 20 October 2016 Cross Ref Eulerian WalksCovering Walks in Graphs | 23 December 2014 Cross Ref Hamiltonian WalksCovering Walks in Graphs | 24 December 2013 Cross Ref Traceable WalksCovering Walks in Graphs | 24 December 2013 Cross Ref Greedily constructing maximal partial f -factorsDiscrete Mathematics, Vol. 309, No. 8 | 1 Apr 2009 Cross Ref Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forestsDiscrete Mathematics, Vol. 307, No. 15 | 1 Jul 2007 Cross Ref Short proofs of classical theoremsJournal of Graph Theory, Vol. 44, No. 3 | 10 October 2003 Cross Ref Lightpath arrangement in survivable rings to minimize the switching costIEEE Journal on Selected Areas in Communications, Vol. 20, No. 1 | 1 Jan 2002 Cross Ref Approximation Algorithms for Survivable Optical NetworksDistributed Computing | 15 March 2002 Cross Ref Randomly planar graphsDiscrete Mathematics, Vol. 175, No. 1-3 | 1 Oct 1997 Cross Ref Spanning trees with pairwise nonadjacent endverticesDiscrete Mathematics, Vol. 170, No. 1-3 | 1 Jun 1997 Cross Ref On the existence of special depth first search treesJournal of Graph Theory, Vol. 19, No. 4 | 1 Jul 1995 Cross Ref Extending cycles in graphsDiscrete Mathematics, Vol. 85, No. 1 | 1 Nov 1990 Cross Ref Almost Every Randomly Near-Traceable Graph has Diameter at Most TwoBing ZhouSIAM Journal on Discrete Mathematics, Vol. 1, No. 2 | 8 August 2006AbstractPDF (1038 KB)Randomly Near-Traceable GraphsJohn Frederick FinkSIAM Journal on Algebraic Discrete Methods, Vol. 6, No. 2 | 3 August 2006AbstractPDF (763 KB)RandomlyH-coverable graphsPeriodica Mathematica Hungarica, Vol. 16, No. 1 | 1 Mar 1985 Cross Ref On randomly 3-axial graphsBulletin of the Australian Mathematical Society, Vol. 25, No. 2 | 17 April 2009 Cross Ref Atoll decompositions of graphsJournal of Graph Theory, Vol. 6, No. 3 | 1 Jan 1982 Cross Ref Randomly antitraceable digraphsJournal of Graph Theory, Vol. 6, No. 4 | 1 Jan 1982 Cross Ref Cycles in digraphs- a surveyJournal of Graph Theory, Vol. 5, No. 1 | 3 October 2006 Cross Ref Randomly k -axial graphsBulletin of the Australian Mathematical Society, Vol. 23, No. 1 | 17 April 2009 Cross Ref Randomly matchable graphsJournal of Graph Theory, Vol. 3, No. 2 | 1 Jan 1979 Cross Ref Path coverings of the vertices of a treeDiscrete Mathematics, Vol. 25, No. 1 | 1 Jan 1979 Cross Ref On separating cycles in graphsDiscrete Mathematics, Vol. 22, No. 1 | 1 Jan 1978 Cross Ref Geodetic connectivity of graphsIEEE Transactions on Circuits and Systems, Vol. 24, No. 8 | 1 Aug 1977 Cross Ref Edge sets contained in circuitsIsrael Journal of Mathematics, Vol. 24, No. 3-4 | 1 Dec 1976 Cross Ref On randomly Hamiltonian graphsMathematische Annalen, Vol. 200, No. 3 | 1 Sep 1973 Cross Ref Graphs in which every finite path is contained in a circuitMathematische Annalen, Vol. 203, No. 1 | 1 Mar 1973 Cross Ref n-Hamiltonian graphsJournal of Combinatorial Theory, Vol. 9, No. 3 | 1 Oct 1970 Cross Ref A note on K-path hamiltonian graphsJournal of Combinatorial Theory, Vol. 7, No. 2 | 1 Sep 1969 Cross Ref Variations on a theorem of PósaThe Many Facets of Graph Theory | 22 August 2006 Cross Ref Generalization of a theorem of PósaProceedings of the American Mathematical Society, Vol. 21, No. 1 | 1 January 1969 Cross Ref Volume 16, Issue 4| 1968SIAM Journal on Applied Mathematics653-887 History Submitted:16 December 1967Published online:12 July 2006 InformationCopyright © 1968 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0116056Article page range:pp. 696-700ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics