Search results
Results from the WOW.Com Content Network
The paper written by Leonhard Euler on the Seven Bridges of Königsberg and published in 1736 is regarded as the first paper in the history of graph theory. [20] This paper, as well as the one written by Vandermonde on the knight problem , carried on with the analysis situs initiated by Leibniz .
Snark (graph theory) Sparse graph. Sparse graph code; Split graph; String graph; Strongly regular graph; Threshold graph; Total graph; Tree (graph theory). Trellis (graph) Turán graph; Ultrahomogeneous graph; Vertex-transitive graph; Visibility graph. Museum guard problem; Wheel graph
Graph Theory, 1736–1936 is a book in the history of mathematics on graph theory.It focuses on the foundational documents of the field, beginning with the 1736 paper of Leonhard Euler on the Seven Bridges of Königsberg and ending with the first textbook on the subject, published in 1936 by Dénes Kőnig.
The Journal of Graph Theory is a peer-reviewed mathematics journal specializing in graph theory and related areas, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs.
Spectral graph theory emerged in the 1950s and 1960s. Besides graph theoretic research on the relationship between structural and spectral properties of graphs, another major source was research in quantum chemistry , but the connections between these two lines of work were not discovered until much later. [ 15 ]
Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric, combinatoric, or algorithmic approaches. There are three main branches of algebraic graph theory, involving the use of linear algebra, the use of group theory, and the study of graph invariants.
The case = is also easy: the graphs requiring three colors are the non-bipartite graphs, and every non-bipartite graph has an odd cycle, which can be contracted to a 3-cycle, that is, a minor. In the same paper in which he introduced the conjecture, Hadwiger proved its truth for =.
Forbidden graph characterizations may be used in algorithms for testing whether a graph belongs to a given family. In many cases, it is possible to test in polynomial time whether a given graph contains any of the members of the obstruction set, and therefore whether it belongs to the family defined by that obstruction set.