AbstractIn this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n,6δ−15}, thereby generalizing several known results
AbstractKuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimu...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
AbstractIn this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cy...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle ...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractA known result obtained independently by Fan and Jung is that every 3-connected k-regular gr...
AbstractUsing Ryjáček's closure, we prove that any 3-connected claw-free graph of order ν and minimu...
Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle o...
Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle o...
AbstractIn this paper, we show that every 2-connected, k-regular claw-free graph on n vertices conta...
AbstractIn this paper, we get the following result: Let G be a 3-connected graph with n vertices. Th...
AbstractKuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimu...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
AbstractIn this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cy...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle ...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractA known result obtained independently by Fan and Jung is that every 3-connected k-regular gr...
AbstractUsing Ryjáček's closure, we prove that any 3-connected claw-free graph of order ν and minimu...
Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle o...
Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle o...
AbstractIn this paper, we show that every 2-connected, k-regular claw-free graph on n vertices conta...
AbstractIn this paper, we get the following result: Let G be a 3-connected graph with n vertices. Th...
AbstractKuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimu...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
DOI
Add to ORKG