My papers - Ron Gould (Papers still under construction, more later.)


101. New conditions for $k$-ordered hamiltonian graphs [paper101 2004]

102. Locally semicomplete digraphs with a factor composed of k cycles [paper102 2004]

103. Generalizing pancyclic and ordered graphs [paper103 2004]

104. Toughness, degrees and 2-factors, with R.J. Faudree [paper104 2004]

105. Pancyclicity in 3-connected graphs: forbidden pairs [paper105 2004]

106. Linear forests and ordered cycles [paper106 2004]

107. Variations of pancyclic graphs [paper107 2004]

108. Forbidden triples implying hamiltonicity: for all graphs, [paper108 2004]

109. Graph minors and linkages, [paper109 2005]

110. A note on neighborhood unions and independent cycles [paper110 2005]

111. Potential forbidden triples implying hamiltonicity: for sufficiently large graphs [paper111 2005]

112. A note on 2-factors with two components [paper112 2005]

113. Minimial degree and (k,m)-pancyclic ordered graphs [paper113 2005]

114. Distance between two k-sets and path-systems extendibility [paper114 2006]

115. Constructive upper bounds for cycle saturated graphs [paper115 2006]

116. A note cycles in 2-factors of line graphs [paper116 2006]

117. On H-linked graphs [paper117 2006]

118. Cycle extendability of hamiltonian interval graphs [paper118 2006]

119. On Minimum degree implying a graph is H-linked [paper119 2006]

120. A new sufficient condition for Hamiltonian graphs [paper120 2006]

121. Minimum degree and the minimum size of K^t_2-saturated graphs [paper121 2007]

122. Subdivision extendibility [paper122 2007]

123. On the extremal number of edges in 2-factor hamiltonian graphs [paper123 2007]

124. Graphic sequences with a realization containing a friendship graph [paper124 2007]

125. The Chvatal-Erdos condition and 2-factors with a specified number of components [paper125 2007]

126. The structure and existence of 2-factors in iterated line graphs [paper126 2007]

127. On H-Immersion [paper127 2008]

128. Graphic sequences with a realization containing a complete multipartite subgraph [paper128 2008]

129. Decompositions of complete multipartite graphs into 6-cycles using complete differences [paper129 2008]

130. Saturation numbers of books [paper130 2008]

131. Pancyclic graphs and linear forests [paper131 2009]

132. Minimum degree and pan-k-linked graphs [paper132 2009]

133. Disjoint hamiltonian cycles in bipartite graphs [paper133 2009]

134. Using edge exchanges to prove the Erdos-Jacobson-Lehel conjecture [paper134 2009]

135. tK_p-saturated graphs of minimum size [paper135 2009]

136. A look at cycles containinig specified elements [paper136 2009]

137. Saturation numbers for trees [paper137 2009]

138. Critical graphs for subpancyclicity of 3-connected claw-free graphs [paper138 2009]

139. Ramsey numbers in rainbow triangle free colorings [paper139 2010]

140. Chvatal-Erdos type theorems [paper140 2010]

141. An iterative approach to graph irregularity strength [paper141 2010]

142. A note on the Song-Zhang Theorem for hamiltonian graphs [paper142 2010]

143. Saturation numbers for Ramsey-minimal graphs [paper143 2011]

144. Forbidden pairs for k-connected Hamiltonian graphs [paper144 2012]

145. Distributing vertices on hamiltonian cycles [paper145 2012]

146. Minimum degree and disjoint cycles in claw-free graphs [paper146 2012]

147. Edge spectrum of K_4 - saturated graphs [paper147 2012]

148. New Ore-type conditions for H-linked graphs [paper148 2011]

149. The edge spectrum of the saturation number for small paths [paper149 2012]

150. Property P_d,m and efficient design of reliable networks [paper150 2012]

151. On the non-(p-1)partite K_p-free Graphs [paper151 2013]

152. Minimum degree and disjoint cycles in generalized claw-free graphs [paper152 2013]

153. Independent cycles and chorded cycles in graphs [paper153 2013]

154. Saturation numbers for nearly complete graphs [paper154 2013]

155. A note on powers of cycles in generalized claw-free graphs [paper155 2013]

156. Pancyclicity of 4-connected {claw, generalized bull}-free graphs [paper156 2013]

157. Precise location of vertices on hamiltonian cycles [paper157 2013]

158. Weak saturation numbers for sparse graphs [paper158 2013]

159. Recent Advances on the Hamiltonian Problem: Survey III [paper159 2014]

160. Multiply chorded cycles [paper160 2014]

161. 3-Connected {K_{1,3}, P_9}-free graphs are Hamiltonian-connected [paper161 2014]

162. Weak saturation numbers for multiple copiesA [paper162 2014]

163. Disjoint chorded cycles of the same length [paper163 2015]

164. On independent doubly chorded cycles [paper164 2015]

165. Results and problems on saturation numbers for linear forests [paper165 2015]

166. Chorded cycles [paper166 2016]

167. Minimum degree and even cycle lengths [paper167 2016]

168. Minimum degree and dominating paths [paper168 2017]

169. A note on Extending Bondy's meta-conjecture [paper169 2017]

170. Placing vertices at precise locations on a hamiltonian cycle [paper170 2017]

171. Saturation spectrum of paths and stars, [paper171 2017]

172. Forbidden subgraphs for chorded Pancyclicity [paper172 2017]

173. On vertex disjoint cycles and degree sum conditions. [paper173 2018]