Matches in SemOpenAlex for { <https://semopenalex.org/work/W2970205223> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2970205223 endingPage "124639" @default.
- W2970205223 startingPage "124639" @default.
- W2970205223 abstract "A path P in an edge-colored graph is called a conflict-free path if there exists a color used on only one of the edges of P. An edge-colored graph G is called conflict-free connected if for each pair of distinct vertices of G there is a conflict-free path in G connecting them. The graph G is called strongly conflict-free connected if for every pair of vertices u and v of G there exists a conflict-free path of length dG(u, v) in G connecting them. For a connected graph G, the strong conflict-free connection number of G, denoted by scfc(G), is defined as the smallest number of colors that are required in order to make G strongly conflict-free connected. In this paper, we first show that if Gt is a connected graph with m ( ≥ 2) edges and t edge-disjoint triangles, then scfc(Gt)≤m−2t, and the equality holds if and only if Gt≅Sm−t,t. Then we characterize the graphs G with scfc(G)=k for k∈{1,m−3,m−2,m−1,m}. In the end, we present a complete characterization for the cubic graphs G with scfc(G)=2." @default.
- W2970205223 created "2019-09-05" @default.
- W2970205223 creator A5030357379 @default.
- W2970205223 creator A5060372856 @default.
- W2970205223 date "2020-01-01" @default.
- W2970205223 modified "2023-10-17" @default.
- W2970205223 title "Strong conflict-free connection of graphs" @default.
- W2970205223 cites W2083641445 @default.
- W2970205223 cites W2112505974 @default.
- W2970205223 cites W2589833411 @default.
- W2970205223 cites W2794264135 @default.
- W2970205223 cites W2891323680 @default.
- W2970205223 cites W2926111868 @default.
- W2970205223 cites W2929598537 @default.
- W2970205223 cites W2963588339 @default.
- W2970205223 cites W2964002080 @default.
- W2970205223 doi "https://doi.org/10.1016/j.amc.2019.124639" @default.
- W2970205223 hasPublicationYear "2020" @default.
- W2970205223 type Work @default.
- W2970205223 sameAs 2970205223 @default.
- W2970205223 citedByCount "0" @default.
- W2970205223 crossrefType "journal-article" @default.
- W2970205223 hasAuthorship W2970205223A5030357379 @default.
- W2970205223 hasAuthorship W2970205223A5060372856 @default.
- W2970205223 hasBestOaLocation W29702052232 @default.
- W2970205223 hasConcept C114614502 @default.
- W2970205223 hasConcept C118615104 @default.
- W2970205223 hasConcept C132525143 @default.
- W2970205223 hasConcept C33923547 @default.
- W2970205223 hasConcept C45340560 @default.
- W2970205223 hasConcept C76444178 @default.
- W2970205223 hasConceptScore W2970205223C114614502 @default.
- W2970205223 hasConceptScore W2970205223C118615104 @default.
- W2970205223 hasConceptScore W2970205223C132525143 @default.
- W2970205223 hasConceptScore W2970205223C33923547 @default.
- W2970205223 hasConceptScore W2970205223C45340560 @default.
- W2970205223 hasConceptScore W2970205223C76444178 @default.
- W2970205223 hasFunder F4320321001 @default.
- W2970205223 hasLocation W29702052231 @default.
- W2970205223 hasLocation W29702052232 @default.
- W2970205223 hasOpenAccess W2970205223 @default.
- W2970205223 hasPrimaryLocation W29702052231 @default.
- W2970205223 hasRelatedWork W1620856143 @default.
- W2970205223 hasRelatedWork W1956467023 @default.
- W2970205223 hasRelatedWork W2017331178 @default.
- W2970205223 hasRelatedWork W2024593554 @default.
- W2970205223 hasRelatedWork W2074698001 @default.
- W2970205223 hasRelatedWork W2103433871 @default.
- W2970205223 hasRelatedWork W2948993755 @default.
- W2970205223 hasRelatedWork W4211106626 @default.
- W2970205223 hasRelatedWork W4295294282 @default.
- W2970205223 hasRelatedWork W4297907804 @default.
- W2970205223 hasVolume "364" @default.
- W2970205223 isParatext "false" @default.
- W2970205223 isRetracted "false" @default.
- W2970205223 magId "2970205223" @default.
- W2970205223 workType "article" @default.