Generalized connectivity of graphs / Xueliang Li, Yaping Mao |
Autore | Li, Xueliang |
Pubbl/distr/stampa | [Cham], : Springer, 2016 |
Descrizione fisica | X, 143 p. : ill. ; 24 cm |
Altri autori (Persone) | Mao, Yaping |
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 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN0114793 |
Li, Xueliang | ||
[Cham], : Springer, 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Generalized connectivity of graphs / Xueliang Li, Yaping Mao |
Autore | Li, Xueliang |
Pubbl/distr/stampa | [Cham], : Springer, 2016 |
Descrizione fisica | X, 143 p. : ill. ; 24 cm |
Altri autori (Persone) | Mao, Yaping |
Soggetto topico |
05C05 - Trees [MSC 2020]
05C35 - Extremal problems in graph theory [MSC 2020] 05C40 - Connectivity [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C76 - Graph operations (line graphs, products, etc.) [MSC 2020] 05C80 - Random graphs (graph-theoretic aspects) [MSC 2020] 05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] 68M10 - Network design and communication in computer systems [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [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 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN00114793 |
Li, Xueliang | ||
[Cham], : Springer, 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Generalized connectivity of graphs / Xueliang Li, Yaping Mao |
Autore | Li, Xueliang |
Edizione | [[Cham] : Springer, 2016] |
Pubbl/distr/stampa | X, 143 p., : ill. ; 24 cm |
Descrizione fisica | Pubblicazione in formato elettronico |
Altri autori (Persone) | Mao, Yaping |
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] |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAMPANIA-SUN0114793 |
Li, Xueliang | ||
X, 143 p., : ill. ; 24 cm | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|