X-Nico

2 unusual facts about Graph theory


Ancient Anguish

Ancient Anguish is based on a "map-coordinate" system rather than linked areas, which contributes to the immersive feeling of entering another 'world'.

Gamma

Chromatic number of a graph, sometimes \chi (Chi) is used, which is also used for the Euler characteristic


Address space

Some nested domains hierarchy appears in the case of directed ordered tree as for the Domain Name System or a directory structure; this similar to hierarchical design of postal addresses.

H. B. Walikar

Dr. Walikar got his Ph.D. (1982) in mathematics for his thesis on graph theory from the same university under the guidance of Professor E. Sampathkumar.

Linking number

The graphs that have a linkless embedding have a forbidden minor characterization as the graphs with no Petersen family minor.

Michel Balinski

Balinski's theorem, which he published in 1961, gives a lower bound on the graph-theoretic connectivity of every convex polytope.

Richard K. Guy

He is best known for co-authorship (with John Conway and Elwyn Berlekamp) of Winning Ways for your Mathematical Plays and authorship of Unsolved Problems in Number Theory (ISBN 0-387-94289-0), but he has also published over 100 papers and books covering combinatorial game theory, number theory and graph theory.

Road coloring problem

In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions.

S. A. Choudum

Sheshayya A. Choudum (born 1947) is a professor and a former chair of the department of mathematics at IIT Madras specializing in graph theory.


see also

Eurocomb

Eurocomb, the European Conference on Combinatorics, Graph Theory and Applications, is a highly reputable academic conference in the mathematical field of combinatorics.

Gordon Royle

Royle is the co-author (with Chris Godsil) of the book Algebraic Graph Theory (Springer Verlag, 2001, ISBN 0-387-95220-9).

L. W. Beineke

Tournaments, K. B. Reid, L. W. Beineke - Selected topics in graph theory, 1978

Separation theorem

Planar separator theorem (graph theory) states that any planar graph can be split into smaller pieces by removing a small number of vertices.

Two-graph

Chris Godsil and Gordon Royle (2001), Algebraic Graph Theory. Graduate Texts in Mathematics, Vol.