Matches in SemOpenAlex for { <https://semopenalex.org/work/W4376954707> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W4376954707 abstract "An edge-colored graph is emph{rainbow }if no two edges of the graph have the same color. An edge-colored graph $G^c$ is called emph{properly colored} if every two adjacent edges of $G^c$ receive distinct colors in $G^c$. A emph{strongly edge-colored} graph is a proper edge-colored graph such that every path of length $3$ is rainbow. We call an edge-colored graph $G^c$ emph{rainbow vertex pair-pancyclic} if any two vertices in $G^c$ are contained in a rainbow cycle of length $ell$ for each $ell$ with $3 leq ell leq n$. In this paper, we show that every strongly edge-colored graph $G^c$ of order $n$ with minimum degree $delta geq frac{2n}{3}+1$ is rainbow vertex pair-pancyclicity." @default.
- W4376954707 created "2023-05-18" @default.
- W4376954707 creator A5010446607 @default.
- W4376954707 creator A5042532589 @default.
- W4376954707 date "2023-05-16" @default.
- W4376954707 modified "2023-10-01" @default.
- W4376954707 title "Rainbow vertex pair-pancyclicity of strongly edge-colored graphs" @default.
- W4376954707 doi "https://doi.org/10.46298/dmtcs.10142" @default.
- W4376954707 hasPublicationYear "2023" @default.
- W4376954707 type Work @default.
- W4376954707 citedByCount "0" @default.
- W4376954707 crossrefType "journal-article" @default.
- W4376954707 hasAuthorship W4376954707A5010446607 @default.
- W4376954707 hasAuthorship W4376954707A5042532589 @default.
- W4376954707 hasBestOaLocation W43769547071 @default.
- W4376954707 hasConcept C114614502 @default.
- W4376954707 hasConcept C118615104 @default.
- W4376954707 hasConcept C120665830 @default.
- W4376954707 hasConcept C121332964 @default.
- W4376954707 hasConcept C123809776 @default.
- W4376954707 hasConcept C132525143 @default.
- W4376954707 hasConcept C149530733 @default.
- W4376954707 hasConcept C159985019 @default.
- W4376954707 hasConcept C192562407 @default.
- W4376954707 hasConcept C203776342 @default.
- W4376954707 hasConcept C2776558979 @default.
- W4376954707 hasConcept C2778307483 @default.
- W4376954707 hasConcept C33923547 @default.
- W4376954707 hasConcept C80899671 @default.
- W4376954707 hasConceptScore W4376954707C114614502 @default.
- W4376954707 hasConceptScore W4376954707C118615104 @default.
- W4376954707 hasConceptScore W4376954707C120665830 @default.
- W4376954707 hasConceptScore W4376954707C121332964 @default.
- W4376954707 hasConceptScore W4376954707C123809776 @default.
- W4376954707 hasConceptScore W4376954707C132525143 @default.
- W4376954707 hasConceptScore W4376954707C149530733 @default.
- W4376954707 hasConceptScore W4376954707C159985019 @default.
- W4376954707 hasConceptScore W4376954707C192562407 @default.
- W4376954707 hasConceptScore W4376954707C203776342 @default.
- W4376954707 hasConceptScore W4376954707C2776558979 @default.
- W4376954707 hasConceptScore W4376954707C2778307483 @default.
- W4376954707 hasConceptScore W4376954707C33923547 @default.
- W4376954707 hasConceptScore W4376954707C80899671 @default.
- W4376954707 hasIssue "Graph Theory" @default.
- W4376954707 hasLocation W43769547071 @default.
- W4376954707 hasOpenAccess W4376954707 @default.
- W4376954707 hasPrimaryLocation W43769547071 @default.
- W4376954707 hasRelatedWork W112295190 @default.
- W4376954707 hasRelatedWork W1535276897 @default.
- W4376954707 hasRelatedWork W1621780462 @default.
- W4376954707 hasRelatedWork W2804494934 @default.
- W4376954707 hasRelatedWork W2939412085 @default.
- W4376954707 hasRelatedWork W2949480075 @default.
- W4376954707 hasRelatedWork W3000408518 @default.
- W4376954707 hasRelatedWork W3082187648 @default.
- W4376954707 hasRelatedWork W4299574198 @default.
- W4376954707 hasRelatedWork W4300577104 @default.
- W4376954707 hasVolume "vol. 25:1" @default.
- W4376954707 isParatext "false" @default.
- W4376954707 isRetracted "false" @default.
- W4376954707 workType "article" @default.