Graph Theory
-10%
portes grátis
Graph Theory
An Introduction to Proofs, Algorithms, and Applications
Saoub, Karin R
Taylor & Francis Ltd
03/2021
438
Dura
Inglês
9781138361409
15 a 20 dias
748
Descrição não disponível.
Chapter 1: Graph Models, Terminology, and Proofs
Chapter 2: Graph Routes
Chapter 3: Trees
Chapter 4: Connectivity and Flow
Chapter 5: Matching and Factors
Chapter 6: Graph Coloring
Chapter 7: Planarity
Appendix
Selected Hints and Solutions
Chapter 2: Graph Routes
Chapter 3: Trees
Chapter 4: Connectivity and Flow
Chapter 5: Matching and Factors
Chapter 6: Graph Coloring
Chapter 7: Planarity
Appendix
Selected Hints and Solutions
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Hamiltonian Cycle;Graph theory;Eulerian Circuit;Hierholzer's algorithm;Bipartite Graphs;Hamiltonian cycles;Complete Graph;Graph terminology;Augmenting Path;Eulerian circuits;Vertex Cover;Augmenting Path Algorithm;Crossing Number;Chromatic Number;Interval Graphs;Hamiltonian Path;Score Sequence;Minimum Vertex Cover;Stable Matching;Kruskal's Algorithm;Planar Graph;Edge Crossings;Maximum Matching;Induced Subgraph;Odd Vertices;Eulerian Trail;Search Tree;Adjacency Matrix;Odd Cycle;Kuratowski's Theorem
Chapter 1: Graph Models, Terminology, and Proofs
Chapter 2: Graph Routes
Chapter 3: Trees
Chapter 4: Connectivity and Flow
Chapter 5: Matching and Factors
Chapter 6: Graph Coloring
Chapter 7: Planarity
Appendix
Selected Hints and Solutions
Chapter 2: Graph Routes
Chapter 3: Trees
Chapter 4: Connectivity and Flow
Chapter 5: Matching and Factors
Chapter 6: Graph Coloring
Chapter 7: Planarity
Appendix
Selected Hints and Solutions
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Hamiltonian Cycle;Graph theory;Eulerian Circuit;Hierholzer's algorithm;Bipartite Graphs;Hamiltonian cycles;Complete Graph;Graph terminology;Augmenting Path;Eulerian circuits;Vertex Cover;Augmenting Path Algorithm;Crossing Number;Chromatic Number;Interval Graphs;Hamiltonian Path;Score Sequence;Minimum Vertex Cover;Stable Matching;Kruskal's Algorithm;Planar Graph;Edge Crossings;Maximum Matching;Induced Subgraph;Odd Vertices;Eulerian Trail;Search Tree;Adjacency Matrix;Odd Cycle;Kuratowski's Theorem
