Matches in SemOpenAlex for { <https://semopenalex.org/work/W2899677703> ?p ?o ?g. }
Showing items 1 to 58 of
58
with 100 items per page.
- W2899677703 abstract "In [5], we found an upper bound on the number of edges, $mathcal{E}(G)$, of a graph $G$ containing no $r$ vertex-disjoint cycles of length 3. In this paper we generalize this result to graphs containing no $r$ vertex-disjoint cycles of length $2k+1$. We showed that $mathcal{E}(G)les lfloor frac{(n-r+1)^2}{4} rfloor +(r-1)(n-r+1)$ for every $Ginmathcal{G}(n,V_{r,2k+1})$, the class of all graphs on $n$ vertices containing no $r$ vertex-disjoint cycles of length $2k+1$. Determination of the maximum number of edges in a given graph that contains no specific subgraphs is one of the important problems in graph theory. Solving such problems has attracted the attention of many researchers in graph theory." @default.
- W2899677703 created "2018-11-16" @default.
- W2899677703 date "2018-01-01" @default.
- W2899677703 modified "2023-09-26" @default.
- W2899677703 title "An Upper Bound on the Number of Edges of Graphs containing No r Vertex-Disjoint Odd Cycles" @default.
- W2899677703 cites W1484040084 @default.
- W2899677703 cites W2783285849 @default.
- W2899677703 cites W2986768019 @default.
- W2899677703 doi "https://doi.org/10.28919/jmcs/3845" @default.
- W2899677703 hasPublicationYear "2018" @default.
- W2899677703 type Work @default.
- W2899677703 sameAs 2899677703 @default.
- W2899677703 citedByCount "0" @default.
- W2899677703 crossrefType "journal-article" @default.
- W2899677703 hasBestOaLocation W28996777031 @default.
- W2899677703 hasConcept C114614502 @default.
- W2899677703 hasConcept C118615104 @default.
- W2899677703 hasConcept C132525143 @default.
- W2899677703 hasConcept C134306372 @default.
- W2899677703 hasConcept C33923547 @default.
- W2899677703 hasConcept C45340560 @default.
- W2899677703 hasConcept C77553402 @default.
- W2899677703 hasConcept C80899671 @default.
- W2899677703 hasConceptScore W2899677703C114614502 @default.
- W2899677703 hasConceptScore W2899677703C118615104 @default.
- W2899677703 hasConceptScore W2899677703C132525143 @default.
- W2899677703 hasConceptScore W2899677703C134306372 @default.
- W2899677703 hasConceptScore W2899677703C33923547 @default.
- W2899677703 hasConceptScore W2899677703C45340560 @default.
- W2899677703 hasConceptScore W2899677703C77553402 @default.
- W2899677703 hasConceptScore W2899677703C80899671 @default.
- W2899677703 hasLocation W28996777031 @default.
- W2899677703 hasOpenAccess W2899677703 @default.
- W2899677703 hasPrimaryLocation W28996777031 @default.
- W2899677703 hasRelatedWork W1980115191 @default.
- W2899677703 hasRelatedWork W1994895316 @default.
- W2899677703 hasRelatedWork W2012389985 @default.
- W2899677703 hasRelatedWork W2027119806 @default.
- W2899677703 hasRelatedWork W2060657061 @default.
- W2899677703 hasRelatedWork W2091699090 @default.
- W2899677703 hasRelatedWork W2094837750 @default.
- W2899677703 hasRelatedWork W2177103137 @default.
- W2899677703 hasRelatedWork W2331575078 @default.
- W2899677703 hasRelatedWork W2769693038 @default.
- W2899677703 hasRelatedWork W2886743751 @default.
- W2899677703 hasRelatedWork W2899210285 @default.
- W2899677703 hasRelatedWork W2951243860 @default.
- W2899677703 hasRelatedWork W2953266710 @default.
- W2899677703 hasRelatedWork W2964106996 @default.
- W2899677703 hasRelatedWork W2986768019 @default.
- W2899677703 hasRelatedWork W3014690754 @default.
- W2899677703 hasRelatedWork W3142894584 @default.
- W2899677703 hasRelatedWork W3193700348 @default.
- W2899677703 hasRelatedWork W968988343 @default.
- W2899677703 isParatext "false" @default.
- W2899677703 isRetracted "false" @default.
- W2899677703 magId "2899677703" @default.
- W2899677703 workType "article" @default.