|
|
|
|
| LEADER |
01326nam a22002895a 4500 |
| 001 |
4564 |
| 003 |
AR-SrUBC |
| 005 |
20210617131038.0 |
| 007 |
t||||||||||||| |
| 008 |
931122t||||||||nyua||||r|||||||||||eng|| |
| 020 |
|
|
|a 0471513407
|
| 040 |
|
|
|a AR-SrUBC
|b eng
|e rcaa2
|
| 080 |
|
|
|a 519.17=20
|2 3a Abr ES
|
| 100 |
1 |
|
|a Wilson, Robin J.
|9 11146
|
| 245 |
1 |
0 |
|a Graphs :
|b an introductory approach : a first course in discrete mathematics /
|c Robin J. Wilson, John J. Walkins.
|
| 260 |
|
|
|a New York :
|b J. Wiley,
|c c1990.
|
| 300 |
|
|
|a x, 340 p. :
|b il. ;
|c 23 cm.
|
| 336 |
|
|
|a texto
|2 rdacontent
|
| 337 |
|
|
|a sin mediación
|2 rdamedia
|
| 338 |
|
|
|a volumen
|2 rdacarrier
|
| 500 |
|
|
|a Basado sobre "The Open University course Graphs, Networks and Design".
|
| 505 |
0 |
0 |
|a Contenido: What is a graph? -- Definitions and examples -- Applications of graphs -- What is a digraph? -- Applications of digraphs -- Eulerian graphs and digraphs -- Hamiltonian graphs and digraphs -- Path algorithms -- Connectivity -- Trees -- Planarity -- Coloring graphs -- Coloring maps -- Decomposition problems -- Conclusion.
|
| 650 |
|
7 |
|a METODOS GRAFICOS
|2 lemb2
|9 5712
|
| 650 |
|
7 |
|a TEORIA DE GRAFOS
|2 lemb2
|9 11147
|
| 700 |
1 |
|
|a Watkins, John J.
|9 11148
|
| 942 |
|
|
|2 cdu
|b 1993-11-22
|c BK
|d 004622
|h 519.17=20
|i WILg
|z AL
|6 5191720_WILG
|
| 999 |
|
|
|c 4564
|d 4564
|