41. Colorful Mathematics Educational software presents advanced mathematics to K12 students in a game-oriented approach, using coloring and drawing techniques to illustrate concepts from graph theory and computer science. http://www.math.ucalgary.ca/~laf/colorful/colorful.html

COLORFUL MATHEMATICS Mathematics computer games Colorful Mathematics is a series of educational software presenting advanced mathematical concepts to K-12 students in a game-oriented approach. The five games offered utilize simple coloring and/or drawing techniques to illustrate some state of the art mathematical concepts from graph theory and computer science. BACKGROUND IS THIS REALLY MATHEMATICS? THE GAMES TEACHER'S CORNER ... RELATED SITES Funding for this project was made possible through Industry Canada's SchoolNet initiative and through the cooperation of the Canadian Mathematical Society. Chosen as a Selected Web Resource by the National Council of Teachers of Mathematics Illuminations Project

42. Discussiones Mathematicae Discussiones Mathematicae General Algebra and Applications. Discussiones Mathematicaegraph theory. Discussiones Mathematicae Probability and Statistics. http://www.pz.zgora.pl/discuss/

Discussiones Mathematicae. Differential Inclusions Control and Optimization Discussiones Mathematicae - General Algebra and Applications Discussiones Mathematicae Graph Theory Discussiones Mathematicae. Differential Inclusions Control and Optimization Discussiones Mathematicae - General Algebra and Applications Discussiones Mathematicae Graph Theory ... Discussiones Mathematicae Probability and Statistics

43. Institute Of Theoretical Computer Science ETH, Zurich. The members are active in teaching and research in topics including design and analysis of algorithms, in particular in graph theory and computational geometry; data structures, in particular for spatial data; computability and complexity; information security and cryptography; and parallel computation. http://www.inf.ethz.ch/department/TI/

Home Research Education People ... Werner Hartmann, Senior Scientist 23-Aug-2002 / webti@inf.ethz.ch

44. LITQ Publications, laboratory staff members, and Java applets related to quantum cryptography, quantum information, quantum teleportation, computational complexity, algorithmics, and graph theory. http://www.iro.umontreal.ca/labs/theorique/index.html.en

45. The Graph Theory Team Leibniz Laboratory, The graph theory Team. get acquainted with the membersof the graph theory team;; take a look at our overview on graph theory;; http://www-leibniz.imag.fr/GRAPH/english/welcome.html

Leibniz Laboratory, The Graph Theory Team Members Overview References Our topics ... Our software This is the home page of the graph theory team of the Leibniz Laboratory (part of the IMAG Institute , Grenoble, France). From here you can: get acquainted with the members of the graph theory team take a look at our overview on Graph Theory look up a list of general references on Graph Theory; peek at our research topics see the software developed by some member(s) of the team. Winter school : New Methods in Discrete Mathematics Thanks for your visit!

46. Home Page Of Ajit A Diwan Indian Institute of Technology, Bombay Algorithms, graph theory, Combinatorics http://www.cse.iitb.ernet.in/~aad/

Ajit A Diwan Associate Professor Department of Computer Science and Engineering Indian Institute of Technology Powai, Mumbai 400076, India Phone No: 5767720 E-mail: aad@cse.iitb.ernet.in Education and Career Research Interests Recent Publications ... Ph.d Students Education and Career B.Tech - IIT Bombay, 1983 Ph.D - TIFR Bombay, 1989 Faculty in IIT Bombay since 1988 Research Interests Graph theory, Combinatorics, Algorithms Recent Publications Decomposing graphs with girth at least 5 under degree constraints, J. Graph Theory, Vol. , April 2000. Disconnected 2-factors in planar cubic bridgeless graphs, J. Combinatorial Theory, Ser B, Vol. , March 2002. Plane triangulations are 6-partitionable (with Manish P. Kurhekar), Discrete Mathematics, Vol. , September 2002. Degree condition for vertex-disjoint paths On 2-factors in powers of connected graphs (with Narendra Agarwal, submitted) Triangle-factors in powers of graphs (with Narendra Agarwal), presented at R. C. Bose Centenary Symposium, I.S.I, Dec 2002. Courses that I Generally offer Design and Analysis of Algorithms Algorithms and Complexity Discrete Structures Combinatorics Applied Algorithms Data Structures and Algorithms Operations Research Recent M.Tech projects

47. Tietojenkäsittelytieteiden Laitos Department of Computer Science and Information Systems. Research areas include information systems design methods and tools, management, assessment, and applications of information systems, document management, electronic trading, knowledge discovery, knowledgebased systems, object orientation, graph theory, educational technology, advanced data management, and mobile multimedia. http://www.cs.jyu.fi/index_en.html

Department of Computer Science and Information Systems Studying Staff Research Collaboration Location Mattilanniemi, Agora 5th floor Postal address University of Jyväskylä Department of Computer Science and Information Systems P.O. Box 35 SF-40351 Jyväskylä FINLAND Telephone +358 14 260 3010 (office) +358 14 260 3024 (amanuensis) Fax University of Jyväskylä Faculty of Information Technology

48. American Scientist: Computing Science: January-February 2000 graph theory in Practice Part I. The diameter in question is not a geometric distance;the concept comes from the branch of mathematics called graph theory. http://www.sigmaxi.org/amsci/issues/comsci00/compsci2000-01.html

January-February 2000 Computing Science Graph Theory in Practice: Part I Brian Hayes Note: This document is available in other formats What is the diameter of the World Wide Web? The answer is not et al. Connect the Dots The graphs studied by graph theorists have nothing to do with the wiggly-line charts that plot stock prices. Here is a definition of a graph, in all its glory of abstraction: A graph is a pair of sets, V and E , where every element of E is a two-member set whose members are elements of V . For example, this is a graph: V a b c E a b a c So much for definitions; most of us prefer to think of our graphs graphically. And in fact everyone knows that what graph theory is really about is connecting the dots. The set V is made up of vertices (also known as nodes), which are drawn as dots. The set E consists of edges (also called arcs, links or bonds), and each edge is drawn as a line joining the two vertices at its end points. Thus the graph defined abstractly above looks like this: Euler showed that you can answer the question by tabulating the degree or valency The techniques of graph theory soon proved useful for more than planning a stroll along the Pregel. The German physicist Gustav Kirchoff analyzed electric circuits in terms of graphs, with wires as edges and junction points as vertices. Chemists found a natural correspondence between graphs and the structural diagrams of molecules: An atom is a vertex, and an edge is a bond between atoms. Graphs also describe communications and transportation networks, and even the neural networks of the brain. Other applications are less obvious. For example, a chess tournament is a graph: The players are nodes, and matches are edges. An economy is also a graph: Companies or industries are nodes, and edges represent transactions.

49. CAMS - Home Page Laboratory of the C.N.R.S. researching in Combinatorics, graph theory, Partial Orders, Spatial Representations, Language Structure and Dynamic Systems. http://www.ehess.fr/centres/cams

U.M.R. 8557 Projets scientifiques et bibliographie Nos publications Personnel Historique Grands objectifs Renseignements pratiques sur le C.A.M.S. Directeur : Henri BERESTYCKI Directeur adjoint : Bruno LECLERC Adresse du laboratoire 54, bd Raspail 75270 ParisCedex 06 email cams@ehess.fr Adresse 44, rue de l'Amiral Mouchez 75014 Paris delvigna@ivry.cnrs.fr L'Atelier de Taxiplanie (LATES) Adresse Combinatoire, taxiplanie et ordres Langage, logique informatique et cognition (La.L.I.C.) Histoire des sciences Les D.E.A. D.E.A. M.I.A.S.H. D.E.A. Sciences Cognitives D.E.A. Algorithmique Les revues du Laboratoire Mathematics, Humanities and Social Sciences (english version) Les Cahiers du C.A.M.S. European Journal of Combinatorics (english version) Le personnel du C.A.M.S. Les chercheurs Le personnel administratif et technique Doctorants et post-doctorants Les collaborateurs

50. American Scientist: Computing Science: March-April 2000 graph theory in Practice Part II. Brian Hayes. But graph theory is a branch of mathematicsthat has never been afraid to get its hands dirty with applications. http://www.sigmaxi.org/amsci/issues/comsci00/compsci2000-03.html

March-April 2000 March-April, Volume 88, No. 2 Computing Science Graph Theory in Practice: Part II Brian Hayes Note: This document is available in other formats Part I of this article, in the January-February issue, discussed some very large structures that can usefully be looked upon as mathematical graphs. In this context a graph is a set of vertices (which are usually represented as dots) and a set of edges (lines between the dots). One large object that can be described in this way is the World Wide Web; its 800 million pages are the vertices of a graph, and links from one page to another are the edges. A second example comes out of Hollywood: The vertices are 225,000 actors, and an edge connects any two actors who have appeared in a feature film together. Although graph theory has a history of two centuries and more, only in recent years has it been applied routinely to structures like these, with many thousands or millions of vertices and edges. Studying such enormous graphs is by no means easy. The Hollywood collaboration graph just barely fits in the memory of a large computer. The Web, a few orders of magnitude larger, requires all the resources of the Internet to keep track of its tentacles. Certain other graphs are even bigger. The human acquaintanceship graph, with a vertex for every person on earth and edges linking all those who know each other, may never be recorded beyond a few small, sampled regions. The Small World of Large Graphs The various gigantic graphs that have lately attracted notice share other properties besides sheer size. In particular:

51. Old Homepage Of Computer Science And Software Engineering Department of Computer Science and Software Engineering. Research groups include data security, graph theory, information visualization, monetary systems engineering and virtual memory. http://www.cs.newcastle.edu.au/

The homepage of Computer Science and Software Engineering has MOVED! If your browser supports it, you will be automatically redirected to the new location in a few seconds. Otherwise, click the link below. Homepage of the School of Electrical Engineering and Computer Science Please update your bookmarks accordingly!

52. ``Introduction To Graph Theory'' (2nd Edition) Introduction to graph theory Second edition. This is the home pagefor Introduction to graph theory, by Douglas B. West. Published http://www.math.uiuc.edu/~west/igt/

Introduction to Graph Theory - Second edition This is the home page for Introduction to Graph Theory , by Douglas B. West Published by Prentice Hall 1996, 2001. Second edition, xx+588 pages, 1296 exercises, 447 figures, ISBN 0-13-014400-2. First edition 512+xvi pages, 870 exercises, 312 figures, ISBN 0-13-227828-6. Resources Supplementary Exercises not yet in text (to be added in later editions) Solution manual - available to instructors only from george_lobell@prenhall.com Syllabus for a one-semester beginning course (postscript) (used at U Illinois) Contents and Preface for second edition (postscript) Errata for second edition Corrections to notation and to other mathematical aspects Comments and updates (corrections to references, comments on proofs or exercises, etc.) Minor typos (errors in spelling, punctuation, etc.) Resources for first edition (no longer maintained): Errata Syllabus Contents and Preface Reader Poll on Terminology (Now Three Questions!) Terminology is a big problem in graph theory: it is easy to invent terminology, and independently invented terminology is unlikely to agree. Here is your opportunity to vote on terminology. I will try to honor the vote in the third edition. Please send email to west@math.uiuc.edu

53. A CONSTRUCTIVE APPROACH TO GRAPH THEORY Notes on a semiotic approach to constructing isomorphism invariants of graphs by JohnTagore Tevet.Category Science Math Combinatorics graph theory......A CONSTRUCTIVE APPROACH TO graph theory. Title. General.Results. Complementary data. In German. In Russian. http://hot.ee/tewet/

A CONSTRUCTIVE APPROACH TO GRAPH THEORY Title General Results Complementary data ... In Russian

54. Algebraic Graph Theory Home Page The general theme is the geometric representation of graphs and on this occasion the chosen area of Category Science Math graph theory Events Past Conferences......EuroWorkshop on Algebraic graph theory. Edinburgh 913 July 2001. http://www.ma.hw.ac.uk/icms/current/graph/

EuroWorkshop on Algebraic Graph Theory Edinburgh 9-13 July 2001 Workshop Arrangements Scientific Programme Participants List Call for Papers ... Click here for the report on this meeting in ICMS News 11 Timetable available on Scientific Programme page Scientific Committee D. Cvetkovic (Belgrade) W. Haemers (Tilburg) P. Rowlinson (Stirling). The general themeof this second workshop on Algebraic Graph Theory is the geometric representation of graphs and on this occasion the chosen area of application is discrete mathematical chemistry. The workshop provides an opportunity for the scattered communities of algebraic graph theorists and mathematical chemists to discuss recent developments of mutual interest. The main topics are seen as the new fullerenes eigenspace techniques generalizations from distance-regular graphs topological considerations In addition to formally timetabled lectures, there will be ample time for more informal discussion. Most days will begin and end with a lecture from a key speaker, with contributed short papers (20-25 minutes) timetabled in between (using two parallel sessions if necessary to avoid saturation). The meeting is supported by The European Commission (Framework V) The London Mathematical Society The British Combinatorial Committee This meeting's pages last updated 05 July 2001 Future Events Travel Information Call for Proposals Publications ... Front Page

55. Euroconference On Combinatorics, Graph Theory And Applications (COMB01) The Conference concentrates mainly on four areas Algebraic, Algorithmic, geometric and probabilistic combinatorics, including their applications to other areas of mathematics, computer science and engineering. Barcelona, Spain; September 1215, 2001. http://www-mat.upc.es/limda/comb01/

56. Introductory Graph Theory This book has been written by G. Chartrand with several objectives in mind to teach the reader some Category Science Math Combinatorics graph theory Books......Introductory graph theory. By Gary Chartrand Western Michigan University Networksas Mathematical Models. Chapter 2 Elementary Concepts of graph theory. http://www.wmich.edu/math-stat/people/faculty/chartrand/introgt/

Introductory Graph Theory By Gary Chartrand Western Michigan University Published by Dover Paperbacks About the Book Table of Contents Chapter 1: Mathematical Models Nonmathematical Models Mathematical Models Graphs Graphs as Mathematical Models Directed Graphs as Mathematical Models Networks as Mathematical Models Chapter 2: Elementary Concepts of Graph Theory The Degree of a Vertex Isomorphic Graphs Connected Graphs Cut-Vertices and Bridges Chapter 3: Transportation Problems The Konigsberg Bridge Problem: An Introduction to Eulerian Graphs The Salesman's Problem: An Introduction to Hamiltonian Grpahs Chapter 4: Connection Problems The Minimal Connector Problem: An Introduction to Trees Trees and Probability PERT and the Critical Path Method Chapter 5: Party Problems The Problem of Eccentric Hosts: An Introduction to Ramsey Numbers The Dancing Problem: An Introduction to Matching Chapter 6: Games and Puzzles The Problem of the Four Multicolored Cubes: A Solution to "Instant Insanity" The Knight's Tour The Tower of Hanoi The Three Cannibals and Three Missionaries Problem Chapter 7: Digraphs and Mathematical Models A Traffic System Problem: An Introduction to Orientable Graphs Tournaments Paired Comparisons and How to Fix Elections Chapter 8: Graphs and Social Psychology The Problem of Balance The Problem of Clustering Graphs and Transactional Analysis Chapter 9: Planar Graphs and Coloring Problems The Three Houses and Three Utilities Problem: An Introduction to Planar Graphs

57. Graph Theory Of Brian Alspach - Simon Fraser Univ. - 2003 Simon Fraser University, Burnaby, BC, Canada; 2529 May 2003.Category Science Math Combinatorics graph theory Events...... http://www.cs.uleth.ca/gtba/

Your browser is not frames capable. See no-frame version of this page.

58. Journal Of Graph Theory Devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. http://www.interscience.wiley.com/jpages/0364-9024/

A Wiley-Interscience Publication, Wiley Periodicals, Inc., A Wiley Company Online ISSN: 1097-0118 Print ISSN: 0364-9024 Contact Us

59. Fourth Cracow Conference On Graph Theory "Czorsztyn '02" Czorsztyn, Poland; 1620 September 2002.Category Science Math graph theory Events Past Conferences...... of Applied Mathematics University of Mining and Metallurgy in Cracow has organizedFOURTH CRACOW CONFERENCE ON graph theory CZORSZTYN '02 Czorsztyn, Poland http://galaxy.uci.agh.edu.pl/~graphs/

Faculty of Applied Mathematics University of Mining and Metallurgy in Cracow has organized FOURTH CRACOW CONFERENCE ON GRAPH THEORY "CZORSZTYN '02" Czorsztyn, Poland September 16-20, 2002 Deadline for submission of papers to the special issue of Discrete Mathematics is October 31, 2002. If you want to contribute to that volume please send us electronically either .ps or .pdf file as well as three hardcopies of your paper. Conference photos are available in two resolution/quality modes: medium quality (files of aprrox. 700 KB size) high quality (files of aprrox. 2 MB size) e-mail: graphs@uci.agh.edu.pl www: http://galaxy.uci.agh.edu.pl/~graphs phone: ++48 12 617 3582 fax: ++48 12 617 3165 mailing address: Faculty of Applied Mathematics, University of Mining and Metallurgy al. Mickiewicza 30, 30-059 Kraków, Poland

60. Graph Theory Of Brian Alspach - Simon Fraser Univ. - 2003 http://www.cs.uleth.ca/~holzmann/gtba/

Your browser is not frames capable. See no-frame version of this page.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 3     41-60 of 166    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20