scientific article; zbMATH DE number 193589

From MaRDI portal
Publication:4040392





The first chapter of this thesis concerns cycles in triangle-free graphs. It is shown that for any longest cycle C in a 2-connected, triangle-free graph G, if \(| G| \leq 6\delta -5,\) then G-C has at most one edge. It is proved in chapter 2 that any longest cycle in a 2-connected, \(\delta\)-regular, bipartite graph on at most \(6\delta\)-6 vertices is dominating. The result in chapter 3 is that the circumference of any 4-connected, \(\delta\)-regular graph is at least \(\min \{| G|,4\delta -4\}\) or at least \(\max \{3\delta,(| G| +3\delta -2)/2\}.\) In the last chapter, we obtain the following result: if G is a \(\delta\)- regular, bipartite graph and if either G is 2-connected with \(| G| \leq 6\delta -6\) or G is 3-connected, then the circumference is at least \(\min \{| G|,6\delta -14,\quad (| G| +10\delta - 16)/3\}.\) There are also many consequences of the above results.











This page was built for publication:

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