Matches in SemOpenAlex for { <https://semopenalex.org/work/W2754295160> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W2754295160 endingPage "153" @default.
- W2754295160 startingPage "146" @default.
- W2754295160 abstract "Abstract For minimally k ‐connected graphs on n vertices, Mader proved a tight lower bound for the number of vertices of degree k in dependence on n and k . Oxley observed 1981 that in many cases a considerably better bound can be given if is used as additional parameter, i.e. in dependence on m , n , and k . It was left open to determine whether Oxley's more general bound is best possible. We show that this is not the case, but give a closely related bound that deviates from a variant of Oxley's long‐standing one only for small values of m . We prove that this new bound is best possible. The bound contains Mader's bound as special case." @default.
- W2754295160 created "2017-09-25" @default.
- W2754295160 creator A5090170246 @default.
- W2754295160 date "2017-09-18" @default.
- W2754295160 modified "2023-10-18" @default.
- W2754295160 title "Tight bounds for the vertices of degree k in minimally k-connected graphs" @default.
- W2754295160 cites W171464046 @default.
- W2754295160 cites W1987920422 @default.
- W2754295160 cites W2018831729 @default.
- W2754295160 cites W2063263744 @default.
- W2754295160 cites W2073586409 @default.
- W2754295160 cites W2125993726 @default.
- W2754295160 cites W2238639262 @default.
- W2754295160 cites W2320477734 @default.
- W2754295160 doi "https://doi.org/10.1002/jgt.22202" @default.
- W2754295160 hasPublicationYear "2017" @default.
- W2754295160 type Work @default.
- W2754295160 sameAs 2754295160 @default.
- W2754295160 citedByCount "4" @default.
- W2754295160 countsByYear W27542951602018 @default.
- W2754295160 countsByYear W27542951602021 @default.
- W2754295160 countsByYear W27542951602022 @default.
- W2754295160 crossrefType "journal-article" @default.
- W2754295160 hasAuthorship W2754295160A5090170246 @default.
- W2754295160 hasConcept C114614502 @default.
- W2754295160 hasConcept C118615104 @default.
- W2754295160 hasConcept C121332964 @default.
- W2754295160 hasConcept C134306372 @default.
- W2754295160 hasConcept C24890656 @default.
- W2754295160 hasConcept C2775997480 @default.
- W2754295160 hasConcept C33923547 @default.
- W2754295160 hasConcept C77553402 @default.
- W2754295160 hasConceptScore W2754295160C114614502 @default.
- W2754295160 hasConceptScore W2754295160C118615104 @default.
- W2754295160 hasConceptScore W2754295160C121332964 @default.
- W2754295160 hasConceptScore W2754295160C134306372 @default.
- W2754295160 hasConceptScore W2754295160C24890656 @default.
- W2754295160 hasConceptScore W2754295160C2775997480 @default.
- W2754295160 hasConceptScore W2754295160C33923547 @default.
- W2754295160 hasConceptScore W2754295160C77553402 @default.
- W2754295160 hasFunder F4320320879 @default.
- W2754295160 hasIssue "1" @default.
- W2754295160 hasLocation W27542951601 @default.
- W2754295160 hasOpenAccess W2754295160 @default.
- W2754295160 hasPrimaryLocation W27542951601 @default.
- W2754295160 hasRelatedWork W1516407058 @default.
- W2754295160 hasRelatedWork W1978042415 @default.
- W2754295160 hasRelatedWork W1996842245 @default.
- W2754295160 hasRelatedWork W2038812594 @default.
- W2754295160 hasRelatedWork W2052299887 @default.
- W2754295160 hasRelatedWork W2324782219 @default.
- W2754295160 hasRelatedWork W2367376693 @default.
- W2754295160 hasRelatedWork W4246620547 @default.
- W2754295160 hasRelatedWork W4323666601 @default.
- W2754295160 hasRelatedWork W4367190712 @default.
- W2754295160 hasVolume "88" @default.
- W2754295160 isParatext "false" @default.
- W2754295160 isRetracted "false" @default.
- W2754295160 magId "2754295160" @default.
- W2754295160 workType "article" @default.