Exercises in Graph Theory: Texts in the Mathematical Sciences, cartea 19
Autor O. Melnikov, V. Sarvanov, R.I. Tyshkevich, V. Yemelichev, Igor E. Zverovichen Limba Engleză Hardback – 31 mar 1998
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 1002.13 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 5 dec 2010 | 1002.13 lei 6-8 săpt. | |
Hardback (1) | 1389.48 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 31 mar 1998 | 1389.48 lei 6-8 săpt. |
Din seria Texts in the Mathematical Sciences
- Preț: 375.53 lei
- 15% Preț: 648.56 lei
- Preț: 392.75 lei
- 15% Preț: 646.62 lei
- 18% Preț: 1224.99 lei
- 18% Preț: 794.07 lei
- 15% Preț: 652.49 lei
- 18% Preț: 1820.40 lei
- 15% Preț: 642.03 lei
- Preț: 402.76 lei
- Preț: 398.92 lei
- 15% Preț: 637.59 lei
- 15% Preț: 652.64 lei
- Preț: 400.85 lei
- 18% Preț: 957.75 lei
- Preț: 394.29 lei
- 15% Preț: 535.98 lei
- 15% Preț: 652.49 lei
- 18% Preț: 1119.24 lei
- 15% Preț: 600.80 lei
Preț: 1389.48 lei
Preț vechi: 1694.48 lei
-18% Nou
Puncte Express: 2084
Preț estimativ în valută:
265.90€ • 275.93$ • 222.25£
265.90€ • 275.93$ • 222.25£
Carte tipărită la comandă
Livrare economică 18 martie-01 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792349068
ISBN-10: 0792349067
Pagini: 356
Ilustrații: VIII, 356 p.
Dimensiuni: 156 x 234 x 21 mm
Greutate: 0.69 kg
Ediția:1998
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Texts in the Mathematical Sciences
Locul publicării:Dordrecht, Netherlands
ISBN-10: 0792349067
Pagini: 356
Ilustrații: VIII, 356 p.
Dimensiuni: 156 x 234 x 21 mm
Greutate: 0.69 kg
Ediția:1998
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Texts in the Mathematical Sciences
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
1 ABC of Graph Theory.- 2 Trees.- 3 Independence and Coverings.- 4 Connectivity.- 5 Matroids.- 6 Planarity.- 7 Graph Traversals.- 8 Degree Sequences.- 9 Graph Colorings.- 10 Directed Graphs.- 11 Hypergraphs.- Answers to Chapter 1: ABC of Graph Theory.- 1.1 Graphs: Basic Notions.- 1.2 Walks, Paths, Components.- 1.3 Subgraphs and Hereditary Properties of Graphs. Reconstructibility.- 1.4 Operations on Graphs.- 1.5 Matrices Associated with Graphs.- 1.6 Automorphism Group of Graph.- Answers to Chapter 2: Trees.- 2.1 Trees: Basic Notions.- 2.2 Skeletons and Spanning Trees.- Answers to Chapter 3: Independence and Coverings.- 3.1 Independent Vertex Sets and Cliques.- 3.2 Coverings.- 3.3 Dominating Sets.- 3.4 Matchings.- 3.5 Matchings in Bipartite Graphs.- Answers to Chapter 4: Connectivity.- 4.1 Biconnected Graphs and Biconnected Components.- 4.3 Cycles and Cuts.- Answers to Chapter 5: Matroids.- 5.1 Independence Systems.- 5.2 Matroids.- 5.3 Binary Matroids.- Answers to Chapter 6: Planarity.-6.1 Embeddings of Graphs. Euler Formula.- 6.2 Plane Triangulation.- 6.3 Planarity Criteria.- 6.4 Duality and Planarity.- 6.5 Measures of Displanarity.- Answers to Chapter 7: Graph Traversals.- 7.1 Eulerian Graphs.- 7.2 Hamiltonian Graphs.- Answers to Chapter 8: Degree Sequences.- 8.1 Graphical Sequences.- 8.3 Split and Threshold Graphs.- 8.4 Degree Sets and Arity Partitions.- Answers to Chapter 9: Graph Colorings.- 9.1 Vertex Coloring.- 9.2 Chromatic Polynomial.- 9.3 Edge Coloring.- 9.4 Colorings of Planar Graphs.- 9.5 Perfect Graphs.- Answers to Chapter 10: Directed Graphs.- 10.1 Directed Graphs: Basic Notions.- 10.2 Reachability and Components.- 10.3 Matrices Associated with Digraph.- 10.4 Tours and Paths.- 10.5 Tournaments.- 10.6 Base and Kernel.- Answers to Chapter 11: Hypergraphs.- 11.1 Hypergraphs: Basic Notions.- 11.2 Hypergraph Realizations.- Notations.