FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313478211> ?p ?o ?g. }

• W4313478211 endingPage "113679" @default.
• W4313478211 startingPage "113679" @default.
• W4313478211 abstract "A properly colored walk, is a walk where every two consecutive edges have different colors, including the first and last edges in the case when the walk is closed. Properly colored walks have shown to be an effective way to model certain real applications. In view of this, it is natural to ask about the existence of properly colored walks with restrictions on the transitions of colors allowed in the edges of a graph. Let H be a graph, possibly with loops, and G a graph. We will say that G is H-colored iff there exists a function c:E(G)⟶V(H). A path (v0,v1,⋯,vk) in G is an H-path whenever (c(v0v1),⋯,c(vk−1vk)) is a walk in H; in particular, a cycle (v0,v1,⋯,vk,v0) is an H-cycle iff (c(v0v1),c(v1v2),⋯,c(vk−1vk),c(vkv0),c(v0v1)) is a walk in H. Hence, the graph H determines what color transitions are allowed in a walk. An interesting application of H-walks states as follows: suppose that it is required to send a message through a hostile environment (network), in which the edges are colored with its transmission code; in order to make more difficult the decoding task, it is necessary to avoid not only monochromatic transitions, but some specific color transitions that make easier that task. Some authors have studied the existence of H-cycles in an H-colored graph, saying nothing about its length. In this paper, we give conditions that imply the existence of H-paths and H-cycles of certain length, in an H-colored graph with a given structure. As a consequence of the main results, we obtain known theorems in the theory of properly colored walks." @default.
• W4313478211 created "2023-01-06" @default.
• W4313478211 creator A5003927758 @default.
• W4313478211 creator A5020070242 @default.
• W4313478211 creator A5029325738 @default.
• W4313478211 date "2023-02-01" @default.
• W4313478211 modified "2023-10-18" @default.
• W4313478211 title "A generalization of properly colored paths and cycles in edge-colored graphs" @default.
• W4313478211 cites W1984348866 @default.
• W4313478211 cites W1987798963 @default.
• W4313478211 cites W2005620597 @default.
• W4313478211 cites W2008123095 @default.
• W4313478211 cites W2016579766 @default.
• W4313478211 cites W2021134019 @default.
• W4313478211 cites W2069397859 @default.
• W4313478211 cites W2076185206 @default.
• W4313478211 cites W2079569132 @default.
• W4313478211 cites W2105225269 @default.
• W4313478211 cites W2110990225 @default.
• W4313478211 cites W2111641769 @default.
• W4313478211 cites W2335389215 @default.
• W4313478211 cites W2887907926 @default.
• W4313478211 cites W2952679502 @default.
• W4313478211 cites W2968960209 @default.
• W4313478211 cites W4221045572 @default.
• W4313478211 cites W615800166 @default.
• W4313478211 doi "https://doi.org/10.1016/j.tcs.2022.12.029" @default.
• W4313478211 hasPublicationYear "2023" @default.
• W4313478211 type Work @default.
• W4313478211 citedByCount "0" @default.
• W4313478211 crossrefType "journal-article" @default.
• W4313478211 hasAuthorship W4313478211A5003927758 @default.
• W4313478211 hasAuthorship W4313478211A5020070242 @default.
• W4313478211 hasAuthorship W4313478211A5029325738 @default.
• W4313478211 hasConcept C105795698 @default.
• W4313478211 hasConcept C114614502 @default.
• W4313478211 hasConcept C118615104 @default.
• W4313478211 hasConcept C120665830 @default.
• W4313478211 hasConcept C121194460 @default.
• W4313478211 hasConcept C121332964 @default.
• W4313478211 hasConcept C132525143 @default.
• W4313478211 hasConcept C159985019 @default.
• W4313478211 hasConcept C192562407 @default.
• W4313478211 hasConcept C2778307483 @default.
• W4313478211 hasConcept C33923547 @default.
• W4313478211 hasConcept C40833965 @default.
• W4313478211 hasConceptScore W4313478211C105795698 @default.
• W4313478211 hasConceptScore W4313478211C114614502 @default.
• W4313478211 hasConceptScore W4313478211C118615104 @default.
• W4313478211 hasConceptScore W4313478211C120665830 @default.
• W4313478211 hasConceptScore W4313478211C121194460 @default.
• W4313478211 hasConceptScore W4313478211C121332964 @default.
• W4313478211 hasConceptScore W4313478211C132525143 @default.
• W4313478211 hasConceptScore W4313478211C159985019 @default.
• W4313478211 hasConceptScore W4313478211C192562407 @default.
• W4313478211 hasConceptScore W4313478211C2778307483 @default.
• W4313478211 hasConceptScore W4313478211C33923547 @default.
• W4313478211 hasConceptScore W4313478211C40833965 @default.
• W4313478211 hasLocation W43134782111 @default.
• W4313478211 hasOpenAccess W4313478211 @default.
• W4313478211 hasPrimaryLocation W43134782111 @default.
• W4313478211 hasRelatedWork W1993001030 @default.
• W4313478211 hasRelatedWork W2008378335 @default.
• W4313478211 hasRelatedWork W2071379313 @default.
• W4313478211 hasRelatedWork W2153041478 @default.
• W4313478211 hasRelatedWork W2896620677 @default.
• W4313478211 hasRelatedWork W2950155675 @default.
• W4313478211 hasRelatedWork W2963299100 @default.
• W4313478211 hasRelatedWork W3204573871 @default.
• W4313478211 hasRelatedWork W3212087973 @default.
• W4313478211 hasRelatedWork W4292116863 @default.
• W4313478211 hasVolume "946" @default.
• W4313478211 isParatext "false" @default.
• W4313478211 isRetracted "false" @default.
• W4313478211 workType "article" @default.