Caricamento...
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
Mader conjectured in 2010 that for any tree T of order m, every k-connected graph G with minimum degree at least [Formula: see text] contains a subtree [Formula: see text] such that [Formula: see text] is k-connected. This conjecture has been proved for [Formula: see text]; however, it remains open...
Salvato in:
| Pubblicato in: | Combinatorial Algorithms |
|---|---|
| Autore principale: | |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2020
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7254911/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48966-3_24 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|