Graph theory and applications with exercises and problems
coloringsdirected graphsEuler toursHamilton cycleslexBFSmatchingsnetwork flowsoptimal pathsplanar graphsrandomized algorithmsearch algorithmstrees
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
- Graphs and graph algorithms
- scientific article; zbMATH DE number 5570830 (Why is no real title available?)
- scientific article; zbMATH DE number 3557814 (Why is no real title available?)
- Handbook of Graph Theory
- scientific article; zbMATH DE number 1927108 (Why is no real title available?)
- scientific article; zbMATH DE number 815069 (Why is no real title available?)
- scientific article; zbMATH DE number 1426314 (Why is no real title available?)
- Topics in algorithmic graph theory
- Network Analysis
- scientific article; zbMATH DE number 2229025 (Why is no real title available?)
- Algorithmic graph theory. Deterministic and randomized algorithms
This page was built for publication: Graph theory and applications with exercises and problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003644)
