Matches in SemOpenAlex for { <https://semopenalex.org/work/W2038044706> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W2038044706 endingPage "44" @default.
- W2038044706 startingPage "16" @default.
- W2038044706 abstract "This paper examines edge reductions in cyclically k-connected cubic graphs, focusing on when they preserve the cyclic k-connectedness. For a cyclically k-connected cubic graph G, we denote by Nk(G) the set of edges whose reduction gives a cubic graph which is not cyclically k-connected. With the exception of three graphs, Nk(G) consists of the edges in independent k-edge cuts. For this reason we examine the properties and interactions between independent k-edge cuts in cyclically k-connected cubic graphs. These results lead to an understanding of the structure of G[Nk]. For every k, we prove that G[Nk] is a forest with at least k trees if G is a cyclically k-connected cubic graph with girth at least k + 1 and Nk ≠ ⊘. Let fk(ν) be the smallest integer such that |Nk(G)| ≤ fk(ν) for all cyclically k-connected cubic graphs G on ν vertices. For all cyclically 3-connected cubic graphs G such that 6 ≤ ν(G) and N3 ≠ ⊘, we prove that G[N3] is a forest with at least three trees. We determine f3 and state a characterization of the extremal graphs. We define a very restricted subset N4b of N4 and prove that if N4g = N4 − N4b ≠ ⊘, then G[N4g] is a forest with at least four trees. We determine f4 and state a characterization of the extremal graphs. There exist cyclically 5-connected cubic graphs such that E(G) = N5(G), for every ν such that 10 ≤ ν and 16 ≠ ν. We characterize these graphs. Let gk(ν) be the smallest integer such that |Nk(G)| ≤ gk(ν) for all cyclically k-connected cubic graphs G with ν vertices and girth at least k + 1. For k ∈ {3, 4, 5}, we determine gk and state a characterization of the extremal graphs." @default.
- W2038044706 created "2016-06-24" @default.
- W2038044706 creator A5026300558 @default.
- W2038044706 date "1992-09-01" @default.
- W2038044706 modified "2023-10-16" @default.
- W2038044706 title "Edge reductions in cyclically k-connected cubic graphs" @default.
- W2038044706 cites W1695793906 @default.
- W2038044706 cites W1995621089 @default.
- W2038044706 cites W2005124615 @default.
- W2038044706 cites W2018831729 @default.
- W2038044706 cites W2040972324 @default.
- W2038044706 cites W2049034137 @default.
- W2038044706 cites W2059799590 @default.
- W2038044706 cites W2091079949 @default.
- W2038044706 cites W4234132957 @default.
- W2038044706 doi "https://doi.org/10.1016/0095-8956(92)90004-h" @default.
- W2038044706 hasPublicationYear "1992" @default.
- W2038044706 type Work @default.
- W2038044706 sameAs 2038044706 @default.
- W2038044706 citedByCount "29" @default.
- W2038044706 countsByYear W20380447062014 @default.
- W2038044706 countsByYear W20380447062015 @default.
- W2038044706 countsByYear W20380447062016 @default.
- W2038044706 countsByYear W20380447062017 @default.
- W2038044706 countsByYear W20380447062018 @default.
- W2038044706 countsByYear W20380447062019 @default.
- W2038044706 countsByYear W20380447062020 @default.
- W2038044706 countsByYear W20380447062021 @default.
- W2038044706 countsByYear W20380447062022 @default.
- W2038044706 crossrefType "journal-article" @default.
- W2038044706 hasAuthorship W2038044706A5026300558 @default.
- W2038044706 hasBestOaLocation W20380447061 @default.
- W2038044706 hasConcept C100500283 @default.
- W2038044706 hasConcept C114614502 @default.
- W2038044706 hasConcept C118615104 @default.
- W2038044706 hasConcept C132525143 @default.
- W2038044706 hasConcept C203776342 @default.
- W2038044706 hasConcept C22149727 @default.
- W2038044706 hasConcept C33923547 @default.
- W2038044706 hasConceptScore W2038044706C100500283 @default.
- W2038044706 hasConceptScore W2038044706C114614502 @default.
- W2038044706 hasConceptScore W2038044706C118615104 @default.
- W2038044706 hasConceptScore W2038044706C132525143 @default.
- W2038044706 hasConceptScore W2038044706C203776342 @default.
- W2038044706 hasConceptScore W2038044706C22149727 @default.
- W2038044706 hasConceptScore W2038044706C33923547 @default.
- W2038044706 hasIssue "1" @default.
- W2038044706 hasLocation W20380447061 @default.
- W2038044706 hasOpenAccess W2038044706 @default.
- W2038044706 hasPrimaryLocation W20380447061 @default.
- W2038044706 hasRelatedWork W1978042415 @default.
- W2038044706 hasRelatedWork W1988530353 @default.
- W2038044706 hasRelatedWork W2002373719 @default.
- W2038044706 hasRelatedWork W2032104747 @default.
- W2038044706 hasRelatedWork W2913253550 @default.
- W2038044706 hasRelatedWork W2921485930 @default.
- W2038044706 hasRelatedWork W2980927134 @default.
- W2038044706 hasRelatedWork W3003396734 @default.
- W2038044706 hasRelatedWork W3135430512 @default.
- W2038044706 hasRelatedWork W4246619488 @default.
- W2038044706 hasVolume "56" @default.
- W2038044706 isParatext "false" @default.
- W2038044706 isRetracted "false" @default.
- W2038044706 magId "2038044706" @default.
- W2038044706 workType "article" @default.