On the discovery of graphs and graph algorithms

MaRDI QIDQ2965836zbMATH OpenFDO

Authors Christian Laforest

Publication date 3 March 2017

zbMATH Keywords

applications of graphscoversEulerian graphflows in graphsgraphgraph algorithmsgraph coloringgraph theoryHamiltonian graphmatchingplanar graphtree

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Cited in

(2)

• Landmarks in Algorithmic Graph Theory: A Personal Retrospective
• Graphs and networks. Theory and basic algorithms

This page was built for publication: On the discovery of graphs and graph algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965836)