AbstractIn this paper, we show that every 2-connected, k-regular claw-free graph on n vertices contains a cycle of length at least min 4k−2, n (k⩾8), and this result is best possible
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractIfGis a claw-free graph, then there is a graphcl(G) such that (i)Gis a spanning subgraph ofc...
AbstractIn this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cy...
For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle ...
AbstractWe show a construction that gives an infinite family of claw-free graphs of connectivity κ=2...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
AbstractWe prove that, for each longest cycle in a 2-connected triangle-free graph G of minimum vale...
AbstractA known result by the author in 1991 is that every 3-connected claw-free graph on at most 6δ...
AbstractA known result obtained independently by Fan and Jung is that every 3-connected k-regular gr...
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractIfGis a claw-free graph, then there is a graphcl(G) such that (i)Gis a spanning subgraph ofc...
AbstractIn this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cy...
For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle ...
AbstractWe show a construction that gives an infinite family of claw-free graphs of connectivity κ=2...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
AbstractWe prove that, for each longest cycle in a 2-connected triangle-free graph G of minimum vale...
AbstractA known result by the author in 1991 is that every 3-connected claw-free graph on at most 6δ...
AbstractA known result obtained independently by Fan and Jung is that every 3-connected k-regular gr...
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
DOI
Add to ORKG