Problems In Topological Graph Theory Web text by Dan Archdeacon with a list of open questions in topological graph theory. http://www.emba.uvm.edu/~archdeac/newlist/problems.html
Extractions: Burlington VT 05401-1455 USA Do you think you've got problems? I know I do. This paper contains an ongoing list of open questions in topological graph theory. If you are interested in adding a problem to this list please contact me at the addresses above. The spirit is inclusive-don't submit a problem you're saving for your graduate student. If it appears here, it's fair game. If you solve one of the problems, know some additional history, or recognize it as misphrased or just a stupid question, please let me know so that I can keep the list up-to-date. I've taken quite a bit of liberty editing the submissions. I apologize for any errors introduced. Enjoy my problems-I do! Classical questions on genus Coloring graphs and maps Drawings and crossings Paths, cycles, and matchings
Bert Gerards - Graph Theory (Math 214) graph theory Part of Discrete Mathematics 2 (Math 214), Victoria University ofWellington Links point to pdf files. Introduction to graph theory Trees http://www.mcs.vuw.ac.nz/~visitor5/
Gordon Royle's Open Questions Colouring, algebraic graph theory, geometries. http://www.cs.uwa.edu.au/~gordon/remote/questions.html
Extractions: This page lists a variety of questions in combinatorics that I believe are open questions and to which I would be interested in knowing the answer. For the moment there is no particular order to the questions, nor any segregation between questions of great difficulty and importance and incremental advances in pushing back the borders of knowledge. Of course this information will change over time - please let me know if you can update any of the information here. Also I am far from being an expert in many of these areas so if you see any blunders or can inform me of any further information please mail gordon@cs.uwa.edu.au This is all very much under construction - besides being lazy, I have a million other things to do. The ultimate reference for open questions on graph colouring is the recent book Graph Coloring Problems by Tommy Jensen and Bjarne Toft. I will just be mentioning some of the ones that I find most appealing (i.e. nothing to do with embeddings or asymptotics), and some that do not appear in GCP. Prove or disprove Hedetniemi's conjecture that the product of two graphs of chromatic number n must also have chromatic number n. See GCP, Problem 11.1.
Stephen C. Locke graph theory and algorithms. http://www.math.fau.edu/locke/
Extractions: Thesis title: Extremal Properties of Paths, Cycles and k-Colourable Subgraphs of Graphs M.Math. ( Combinatorics and Optimization University of Waterloo B.Math. ( Combinatorics and Optimization and Pure Mathematics University of Waterloo , 1975. Putnam competitor for all four years. Our team won in 1974. Married since 1974 to Joanne Thomson Locke . Sons Daniel and Geoffrey ( Jeff Graph Theory and Graph Theory Algorithms, particularly Dirac-type conditions and long cycles, independence ratio in triangle-free graphs. 1995 recipient of a Teaching Incentive Award . Thank you to all the students who wrote letters on my behalf.
Dr. Bela Bollobas Functional analysis, combinatorics and graph theory. http://www.msci.memphis.edu/faculty/bollobasb.html
Ashay Dharwadker's Profile Algebra, topology, graph theory and theoretical computer science. http://www.geocities.com/dharwadker/profile.html
Gordon Royle Algebraic graph theory. http://www.cs.uwa.edu.au/~gordon/
Dan Archdeacon's Home Page Topological graph theory, combinatorics, theoretical computer science. http://www.emba.uvm.edu/~archdeac/
Extractions: last modified January 29, 2004 I am a Professor in the Department of Mathematics and Statistics at the University of Vermont . For more information click on one of the following: Access Dan Archdeacon's e-mail In the Spring '04 Semester I am teaching: Classes at UVM frequently have Mathematica Labs . Mathematica is a product of Wolfram Research Here is the UVM Registar's home page. Return to the top of the page My research interests are in Graph Theory, Combinatorics, and Theoretical Computer Science. I am particularly interested in Topological Graph Theory. I maintain several other web pages. I direct the Editorial Offices of The Journal of Graph Theory (also see Wiley's JGT home page). We run an Applied Combinatorics Seminar . This is a collaborative effort between UVM's Department of Mathematics and Statistics and St. Michael's University Department of
Hubert De Fraysseix - Home Topological graph theory and combinatorics. http://www.ehess.fr/centres/cams/person/hf/index.html
Rich Lundgren's Homepage Applied graph theory and combinatorial matrix theory. http://www-math.cudenver.edu/~rlundgre/
GETGRATS Home Page A research network funded by the European Commission. http://www.di.unipi.it/~andrea/GETGRATS/
Extractions: a Research Network funded by the European Community GETGRATS (General Theory of Graph Transformation Systems) is a Research TMR Network funded by the European Commission, consisting of seven research groups that are listed here together with the corresponding team leader: University of Antwerp - UIA (Belgium): Prof. Dr. Dirk Janssens Technische Universitaet Berlin - TUB (Germany): Prof. Dr. Hartmut Ehrig Laboratoire Bordelais de Recherche en Informatique - LaBRI (France): Prof. Dr. Michel Bauderon Universitaet Bremen - UNIBREMEN (Germany): Prof. Dr. Hans-Joerg Kreowski University of Leiden - RUL (The Netherlands): Prof. Dr. Grzegorz Rozenberg - UNIPISA (Italy) [main contractor]: Prof. Ugo Montanari - UNIROMA1 (Italy): Prof. Dr. Francesco Parisi Presicce The Network Coordinator is Andrea Corradini (Pisa). The aim of the project is to develop a General Theory of Graph Transformation Systems (GTS) by solidifying the use of mathematics in their study and regarding them as the objects of discourse and interest. Particular emphasis will be placed on the comparison, combination, and unification of the various approaches to graph rewriting, where the involved partners have considerable expertise.
Page Of Yves Lafont University of Marseille II Linear logic, lambda calculus, proof theory, term rewriting. Lafont invented the theory of interaction nets, an elegant theory of graph rewriting. http://iml.univ-mrs.fr/~lafont/welcome.html
Logique De La Programmation The Logic of Programming research team is interested in proof theory and its relations with theoretical computer science. The main topic is mathematical interpretation of proofs nets (proof = graph), denotational semantics (proof = function), and game semantics (proof = strategy). Two realisations of this working programm are Linear Logic and Ludics. http://iml.univ-mrs.fr/ldp/welcome.html
Welcome To JGraphT - A Free Java Graph Library A class library that provides mathematical graphtheory objects and algorithms. JgraphT supports a rich gallery of graphs and is designed to be powerful, extensible and easy to use. Open source, LGPL http://jgrapht.sourceforge.net/
Extractions: JGraphT is a free Java graph library that provides mathematical graph-theory objects and algorithms. JGraphT supports various types of graphs including: Although powerful, JGraphT is designed to be simple . For example, graph vertices can be of any objects. You can create graphs based on: Strings, URLs, XML documents, etc; you can even create graphs of graphs! This code example shows how. Other features offered by JGraphT: graph visualization using the JGraph library ( try this demo! complete source code included, under the terms of the GNU Lesser General Public License comprehensive Javadocs easy extensibility.
Charles Stewart Boston University Programming language theory, optimal reductions, graph reduction, linear logic, semantics of logic, formulae-as-types correspondence, continuation semantics. http://www.linearity.org/cas/
Extractions: I am a postdoctoral researcher in theoretical computer science associated with the Institute of Artifical Intelligence at Technische Universitaet Dresden. In the past, I have been associated with the Theory and Formal Specifications group of Technische Universitaet Berlin, the Linear Naming and Computation section of the Church Project at Boston University, the Department of Computer Science at Brandeis University, and the Foundations of Computation section of the Programming Research Group at Oxford University. My research interests include: Programming language theory: Graph transformation: Graph transformation and the design of distributed algorithms;
David Eppstein - Publications Ramsey theory; Finding multiple nearoptimal solutions; Miscellanous graphtheory. Publications David Eppstein theory Group Inf. Comp. Sci. http://www.ics.uci.edu/~eppstein/pubs/graph.html
Extractions: Avi Wigderson (Institute for Advanced Study) In recent years, new and important connections have emerged between discrete subgroups of Lie groups, automorphic forms and arithmetic on the one hand, and questions in discrete mathematics, combinatorics, and graph theory on the other. One of the first examples of this interaction was the explicit construction of expanders (regular graphs with a high degree of connectedness) via Kazhdan's property T or via Selberg's theorem (lambda Topics to be included are: In the 1980's, results from the theory of automorphic forms were used to construct explicit families of Ramanujan graphs, that is, graphs for which Laplace eigenvalues satisfy strong inequalities. These constructions led to the solution of several long-standing problems in graph theory. The graphs themselves are constructed group-theoretically, as quotients of infinite regular trees (the Bruhat-Tits building) by arithmetic subgroups of the p-adic group SL (Q p ) arising from quaternion algebras. Proving that they have the Ramanujan property requires deep results from arithmetic and the automorphic forms. One uses the Jacquet-Langlands correspondence from the theory of automorphic forms to transport the problem to GL(2) and then invokes arithmetical results (work of Eichler and Deligne on the Ramanujan conjecture for classical modular forms). Work on the mixed case SL
26th Workshop On Graph-Theoretic Concepts In Computer Science (WG 2000) The workshop aims at uniting theory and practice by demonstrating how graphtheoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. June 15-17, 2000, in Konstanz, Germany. http://www.informatik.uni-konstanz.de/wg2000/
WG 2001 The workshop aims at uniting theory and practice by demonstrating how graphtheoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. Boltenhagen near Rostock, Germany ; 1416 June 2001. http://wwwteo.informatik.uni-rostock.de/wg2001/
Extractions: Graph-Theoretic Concepts in Computer Science The WG 2001 workshop continues the series of 26 predecessing WG workshops into the new millenium. Since 1975, WG took place twenty times in Germany, two times in Austria as well as in The Netherlands and once in Italy, in Slovakia and in Switzerland. WG 2001 will be held at Boltenhagen (Mecklenburg-Vorpommern) which is a nice conference site directly at the Baltic Sea side. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The workshop is well-balanced w.r.t. established researchers and young scientists. The proceedings of this workshop have been published in the Springer Lecture Notes in Computer Science series
Advances In The Theory And Practice Of Graph Drawing Advances in the theory and Practice of graph Drawing. Roberto Tamassia. In thistalk, we survey recent advances in the theory and practice of graph drawing. http://www.cs.brown.edu/people/rt/papers/ordal96/ordal96.html
Extractions: rt@cs.brown.edu The visualization of conceptual structures is a key component of support tools for complex applications in science and engineering. Foremost among the visual representations used are drawings of graphs and ordered sets. In this talk, we survey recent advances in the theory and practice of graph drawing. Specific topics include bounds and tradeoffs for drawing properties, three-dimensional representations, methods for constraint satisfaction, and experimental studies. In this paper, we survey selected research trends in graph drawing, and overview some recent results of the author and his collaborators. Graph drawing addresses the problem of constructing geometric representations of graphs, a key component of support tools for complex applications in science and engineering. Graph drawing is a young research field that has growth very rapidly in the last decade. One of its distinctive characteristics is to have furthered collaborative efforts between computer scientists, mathematicians, and applied researchers. A comprehensive bibliography on graph drawing algorithms [ ] cites more than 300 papers written before 1993. Most papers on graph drawing are cited in
