| Autore: |
Li, Xueliang
|
| Titolo: |
Generalized connectivity of graphs / Xueliang Li, Yaping Mao
|
| Pubblicazione: |
[Cham], : Springer, 2016 |
| Titolo uniforme: |
Generalized connectivity of graphs
|
| Descrizione fisica: |
X, 143 p. : ill. ; 24 cm |
| Soggetto topico: |
68Q25 - Analysis of algorithms and problem complexity [MSC 2020] |
| |
05C05 - Trees [MSC 2020] |
| |
05C75 - Structural characterization of families of graphs [MSC 2020] |
| |
05C35 - Extremal problems in graph theory [MSC 2020] |
| |
68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] |
| |
05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] |
| |
05C80 - Random graphs (graph-theoretic aspects) [MSC 2020] |
| |
05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] |
| |
05C40 - Connectivity [MSC 2020] |
| |
05C76 - Graph operations (line graphs, products, etc.) [MSC 2020] |
| |
68M10 - Network design and communication in computer systems [MSC 2020] |
| Soggetto non controllato: |
Combinatorics |
| |
Conjectures |
| |
Connectivity of Graphs |
| |
Edge-connectivity |
| |
Edge-disjoint Steiner trees |
| |
Extremal graph |
| |
Graph product |
| |
Internally disjoint Steiner trees |
| |
Nordhaus-Gaddum-type result |
| |
Open Problems |
| |
Rainbow index of graphs |
| |
Steiner tree |
| Altri autori: |
Mao, Yaping
|
| Titolo autorizzato: |
Generalized connectivity of graphs |
|
| Formato: |
Materiale a stampa  |
| Livello bibliografico |
Monografia |
| Lingua di pubblicazione: |
Inglese |
| Record Nr.: | VAN0114793 |
|
| Lo trovi qui: | Univ. Vanvitelli |
| Localizzazioni e accesso elettronico |
http://dx.doi.org/10.1007/978-3-319-33828-6 |
| Opac: |
Controlla la disponibilità qui |
