81. Open Problems In Graph Theory Involving Steiner Distance Open Problems involving Steiner distance.Category Science Math Combinatorics graph theory Open Problems......Some Open Problems in graph theory. It has been shown by Chartrand,Oellermann, Tian, and Zou that, for a tree T diam n T = n/(n http://www.uwinnipeg.ca/~ooellerm/open_problems/

Some Open Problems in Graph Theory It has been shown by Chartrand, Oellermann, Tian, and Zou that, for a tree T: diam n n This inequality does not hold for graphs in general as was shown by Henning, Oellermann, and Swart . It was shown in the same paper that for a graph G and n=3 and 4: diam n n G. It was shown by Oellermann and Tian that for a tree T: C n-1 (T) is contained in C n It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-center of a graph is contained in its Steiner n-center. It was shown by Beineke, Oellermann and Pippert that if T is a tree, then M n-1 (T) is contained in M n It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-median of a graph is contained in its Steiner n-median. Oellermann and Tian ). It is known that every graph is the 2-median of some graph (see Holbert ,and Hendry ). Steiner n-medians of trees have been completely characterized by

82. Topics In Intersection Graph Theory By TA McKee And FR McMorris Topics in Intersection graph theory by TA McKee and FR McMorris. Bibliographicinformation. Table of Contents. Topics in intersection graph theory. http://www.math.wright.edu/People/Terry_McKee/Button_04_Book.html

Home pages Terry A McKee Department of Mathematics and Statistics College of Science and Mathematics Wright State Home Professor, Department of Mathematics and Statistics Associate Dean, College of Science and Mathematics Oelman Hall Wright State University 3640 Colonel Glenn Highway Dayton OH 45435-0001 phone 937.775.2611 fax 937.775.3068 Topics in intersection graph theory [SIAM Monographs on Discrete Mathematics and Applications #2] Terry A. McKee and F.R. McMorris. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1999, vii+205 pp. ISBN: 0-89871-430-3 QA 166.105.M34 Chapter 1: Intersection Graphs 1.1 Basic Concepts 1.2 Intersection Classes 1.3 Parsimonious Set Representations 1.4 Clique Graphs 1.5 Line Graphs

83. Finite And Infinite Combinatorics Topics include graph theory, extremal and random graphs, combinatorial optimization and number theory, discrepancy theory, infinite combinatorics, and set theory. Budapest, Hungary, January 510, 2001. http://www.renyi.hu/~finf/

Finite and Infinite Combinatorics Budapest Hungary, January 5 (Friday) - 10 (Wednesday), 2001 Dear Colleagues, The special occasion for this meeting is to honour the 70th birthdays of Professors and Download the list of the presented talks in DVI format or in PostScript format. Download the list of participants in DVI format or in PostScript format We would highly appreciate if you filled out and submitted the participant questionnaire of CORDIS here . Thank you. We thank all participants for coming to Budapest The Organizing Commitee G. O. H. Katona (Co-chair) G. Y. Katona (Secretary) Mail address: HUNGARY Phone:(36 1) 201 7656 Phone/Fax: (36 1) 201 6974 Email: finf@renyi.hu

84. CIRM/DONET Graph Theory Workshop The 2000 CIRMDONET WORKSHOP on graph theory May 7-12, 2000 Levico,Trento, Italy List of participants THE PROGRAM -, Robin Thomas http://homepages.cwi.nl/~bgerards/GRAPHSHOP/

The 2000 CIRM-DONET WORKSHOP on GRAPH THEORY May 7-12, 2000 Levico, Trento, Italy List of participants THE PROGRAM Robin Thomas presented the 10-hour course: Structural Graph Theory and Applications to Coloring Robin has set up a web-page with an outline of the course, transparancies of his talks during the workshop, and pointers to relevant literature. Lex Schrijver presented three lectures on: Paths, Matchings, and Algorithms Dominic Welsh presented three lectures on: Counting, Polynomials, and Complexity THE LOCATION The workshop was held at Grand Hotel Bellavista in Levico, a village in the Alps close to Trento. There are many places to sit and work together. The pleasant working atmosphere offered by the hotel is further supported by the scenic surroundings with beautiful hiking possibilities. PARTICIPATION The workshop was open to everyone interested. So not restricted to DONET members. 68 senior and junior researchers in Graph Theory participated at the workshop. They came from all over the world: Brasil, Canada, Czech Republic, France, Germany, Hungary, Italy, Japan, Mexico, The Netherlands, New Zealand, Saudi Arabia, Slovenia, United Kingdom, and the USA (see list of participants ORGANIZATION The meeting has been organized by Michele Conforti (University of Padova

85. SIAM Journal On Discrete Mathematics The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, and coding and communication theory. http://www.siam.org/journals/sidma/sidma.htm

search: SIAM Journal on Discrete Mathematics Jerrold R. Griggs, Editor-in-Chief The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, and coding and communication theory. Click Here for the latest issues. Questions/Comments about our Web pages? Use our suggestion box or send e-mail to the Online Services Manager. About SIAM Membership Journals SIAM News ... Laura B. Helfrich , Online Services Manager Updated: DJC

86. Graph Theory -- From MathWorld graph theory, Graph Connections Relationships Between graph theory and OtherAreas of Mathematics. Oxford, England Oxford University Press, 1997. http://mathworld.wolfram.com/GraphTheory.html

Discrete Mathematics Graph Theory General Graph Theory Graph Theory The mathematical study of the properties of the formal mathematical structures called graphs Adjacency Matrix Adjacency Relation Articulation Vertex ... Walk References Beinecke, L. W. and Wilson, R. J. (Eds.). Graph Connections: Relationships Between Graph Theory and Other Areas of Mathematics. Oxford, England: Oxford University Press, 1997. Berge, C. Graphs and Hypergraphs. Amsterdam, Netherlands: North-Holland, 1976. Berge, C. The Theory of Graphs and Its Applications. New York: Wiley, 1962. Bogomolny, A. "Graphs." http://www.cut-the-knot.org/do_you_know/graphs.shtml Graph Theory: An Introductory Course. New York: Springer-Verlag, 1979. Modern Graph Theory. New York: Springer-Verlag, 1998. Caldwell, C. K. "Graph Theory Tutorials." http://www.utm.edu/departments/math/graph/ Chartrand, G. Introductory Graph Theory. New York: Dover, 1985. Emden-Weinert, T. "Graphs: Theory-Algorithms-Complexity." http://people.freenet.de/Emden-Weinert/graphs.html Foulds, L. R. Graph Theory Applications.

87. EuroConference On Combinatorics, Graph Theory And Applications Centre de Recerca Matem tica, Campus of the Universitat Aut²noma de Barcelona, Spain; 1215 September 2001. http://www.crm.es/comb01/combgraphtheo.htm

88. Graph Theory And Combinatorial Optimization Thematic Programme on graph theory and Combinatorial Optimization.University of Victoria Simon Fraser University British Columbia http://www.pims.math.ca/graph2000/

Thematic Programme on Graph Theory and Combinatorial Optimization University of Victoria Simon Fraser University British Columbia, Canada June 5 - July 28, 2000 This series of four workshops is part of a joint program co-sponsored by the Pacific Institute for the Mathematical Sciences and the Fields Institute for Research in Mathematical Sciences . The one week and two week workshops will be held at universities in the Vancouver area, British Columbia, Canada. Limited financial support is available for graduate students and post-doctoral fellows. Workshops: Dynamic Graph Problems , June 5-9, 2000, University of Victoria, Classroom Building C103 and C128. Graph Decompositions , June 19-30, 2000, Simon Fraser University, East Academic Annex 1100, 1101 and 1102. Flows, Cycles, and Orientations , July 3-14, 2000, Simon Fraser University, East Academic Annex 1100, 1101 and 1102. Colourings and Homomorphisms , July 17-28, 2000, Simon Fraser University, East Academic Annex 1100, 1101 and 1102. Registration: Please submit an application form if you are planning to attend any of the workshops.

89. 14th Cumberland Conference Combinatorics, graph theory and Computing. Dedicated to Richard H. Schelp on his 65th birthday. University of Memphis, TN, USA; 1719 May 2001. http://www.msci.memphis.edu/~balistep/

14th Cumberland Conference University of Memphis, TN May 17-19, 2001 Dedicated to Richard H. Schelp on his 65 th birthday Announcement Background Registration Accommodation ... Participants Announcing the 14th Cumberland Conference The 14th Cumberland Conference was held on the campus of the University of Memphis from 1:30pm Thursday, May 17 to 1pm Saturday, May 19. The organizers wish to thank everyone who attended for making the conference such a success. The 15th Cumberland Conference will be held at the University of Mississippi, May 16-18, 2002. Principal Speakers Gyula Katona Alexandr Kostochka Dana Randall Bjarne Toft Conference funded by the US Army Research Office To contact the organizers, email balistep@msci.memphis.edu Link to Department of Math Sciences Last revised January 3, 2002.

90. Cmpt 371 - Graph Tutorial Introduction graph theory An Introduction One of the first people to experiment withgraph theory was a man by the name of Leonhard Euler (17071783). http://www.cs.usask.ca/resources/tutorials/csconcepts/graphs/tutorial/

91. Graph Theory And Combinatorics Translate this page Combinatorics, graph theory and Applications group, Applied Mathematicsdepartment, Polytechnical University of Catalonia - UPC, DMAT. http://www-mat.upc.es/grup_de_grafs/

Your browser does not support frames. However, you will still be able to navigate through this web site, using your browser's Back button and the following links: Home page Department of Applied Math Home Page Personnel - personal home pages Research Projects ... Private area - for internal use only updated by Roger Trias 1999/05/03

92. Vanderbilt Mathematics, Noncommutative Geometry And Applications graph theory, Combinatorics and Computing in conjunction with the 16th Annual Shanks Lectures. Vanderbilt University, Nashville, Tennessee; May 2124, 2001. http://www.math.vanderbilt.edu/~shanks/

Vanderbilt University, Department of Mathematics Nashville, Tennessee, USA The Clay Mathematics Institute international conference and spring school on NONCOMMUTATIVE GEOMETRY AND APPLICATIONS in conjunction with the 18th Annual Shanks Lecture honoring Baylis and Olivia Shanks Friday, May 2 to Tuesday, May 13, 2003 Schedule This conference/school will feature a lecture series by Alain Connes and several mini-courses by leading experts in noncommutative geometry and its applications to physics and geometry. In addition there will be a number of invited research talks and short contributions. Since a major component of the meeting will be the school, we strongly encourage graduate students and postdocs to participate. Talks will start on Friday, May 2 in the morning and end around noon on Tuesday, May 13. On Friday, May 9, we plan to have a day off since Vanderbilt's commencement takes place on that day. Click to see the Schedule of talks (not yet available). Invited Speakers The following people have agreed to give mini-courses on the topics indicated in italics. Noncommutative Geometry and Applications Jean Bellissard, Georgia Institute of Technology

93. NRICH | Secondary Topics | Graph Theory Calculus + Combinatorics + Complex Numbers + Geometry + GeometryCoordinate +Geometry-Coordinate + Geometry-Euclidean - graph theory + Proof + Groups http://www.nrich.maths.org.uk/topic_tree/Graph_Theory/

NRICH Prime NRICH Club ... Get Printable Page March 03 Magazine Site Update News Events Problems Solutions ... Games Archive Problems Solutions Articles Inspirations ... Interactivities Web board Ask NRICH Asked NRICH NRICH Club Register Tough Nuts About Help! ... Where is NRICH? Associated Projects Maths Thesaurus MOTIVATE EuroMaths Millennium Maths ... Project Display maths using fonts images Help Back Issues Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec Bernard's Bag(P) - solutions(P) Penta Probs(P) - solutions(P) Let Me Try(P) - solutions(P) Kid's Mag(P) Play Games(P) Staff Room(P) 6 Problems - solutions 15+Challenges - solutions Articles Games LOGOland Editorial News Click on the folders to browse problem topics from the secondary site. You can then go directly to each of the problems. Top Level Algebra Analysis Calculus Combinatorics Complex Numbers Geometry Geometry-Cartesian Geometry-Coordinate Geometry-Coordinate Geometry-Euclidean Graph Theory Proof Groups Investigation Investigations Logic Measures Mechanics Number Pre-calculus Probability Programs Properties of Shapes Pythagoras Sequences Statistics Symmetry Trigonometry Unclassified algebra number

94. NRICH | Secondary Topics | Combinatorics | Graph Theory Top Level + 3D + Algebra + Analysis + Calculus Combinatorics + Geometrical -graph theory + Magic labelling + Knots + Numerical + Spatial + Complex Numbers http://www.nrich.maths.org.uk/topic_tree/Combinatorics/Graph_theory/

NRICH Prime NRICH Club ... Get Printable Page March 03 Magazine Site Update News Events Problems Solutions ... Games Archive Problems Solutions Articles Inspirations ... Interactivities Web board Ask NRICH Asked NRICH NRICH Club Register Tough Nuts About Help! ... Where is NRICH? Associated Projects Maths Thesaurus MOTIVATE EuroMaths Millennium Maths ... Project Display maths using fonts images Help Back Issues Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec Bernard's Bag(P) - solutions(P) Penta Probs(P) - solutions(P) Let Me Try(P) - solutions(P) Kid's Mag(P) Play Games(P) Staff Room(P) 6 Problems - solutions 15+Challenges - solutions Articles Games LOGOland Editorial News Click on the folders to browse problem topics from the secondary site. You can then go directly to each of the problems. Top Level Algebra Analysis Calculus Combinatorics Geometrical Graph Theory Graph theory Magic labelling Knots Numerical Spatial Complex Numbers Geometry Geometry-Cartesian Geometry-Coordinate Geometry-Coordinate Geometry-Euclidean Graph Theory Groups Investigation Investigations Logic Measures Mechanics Number Pre-calculus Probability Programs Properties of Shapes Pythagoras Sequences Statistics Symmetry Trigonometry Unclassified algebra number

95. Discrete Mathematics Project -- Graph Theory Activities Main Index Discrete Mathematics Project graph theory Activities. Designing YourOwn City; The Unsuspecting Bridge Inspector; Designing Recycling Routes; http://www.colorado.edu/education/DMP/activities/graph/

Main Index Discrete Mathematics Project Graph Theory Activities Designing Your Own City The Unsuspecting Bridge Inspector Designing Recycling Routes Checker Tournament ... Bomb Threats : An Action Plan Last Update, January 16, 1997 send updates/correctons to James.Arnow@Colorado.EDU

96. Workshop On Computational Graph Theory And Combinatorics Workshop on Computational graph theory and Combinatorics. The Pacific Northwest area is an important center for research in graph theory and combinatorics. http://www.math.uvic.ca/~wcgtc/wcgtc.html

Workshop on Computational Graph Theory and Combinatorics This workshop will be held May 6-8, 1999, at the campus of the University of Victoria , in Victoria, British Columbia, CANADA. NEW: Group photo Group photo Group photo Organizers ... Parking Information and Campus Map NOTE: Please pre-register if you are planning on attending. Organizers Wendy Myrvold and Frank Ruskey Department of Computer Science , University of Victoria. Objectives The "Pacific Northwest" area is an important center for research in graph theory and combinatorics. Computer techniques are becoming ever more critical as an aid in approaching research problems. The aim of this workshop is to bring together leading experts, interested researchers, postdocs and graduate students to share their expertise in applying computational techniques to graph theory and combinatorics problems. Contributed sessions will focus on ways in which research in discrete mathematics has been aided by computational techniques. Invited Speakers The following speakers will present one hour talks. Herbert S. Wilf, University of Pennsylvannia

97. Graph Drawing 2000 The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, geometry, topology, visual languages, visual perception, information visualization, computerhuman interaction, and graphic design. Colonial Williamsburg (Virginia, USA) 2023 September 2000. http://www.cs.virginia.edu/~gd2000/

Colonial Williamsburg (Virginia, USA) September 20-23, 2000 Important News! will be held in Vienna, Austria during September 23-26, 2001. Check out the website!! Workshop on Data Exchange Formats was held on 20 Sept 2000. The report is available here - The GD 2000 Proceedings proceedings are in production, and will ship early in 20001 as Volume 1984 of the Lecture Notes in Computer Science series. Each person registered for GD2000 will automatically receive a copy of the proceedings. (We will update this site once we know they have shipped.) The GD2000 Proceedings are available directly from Springer Verlag. If the previous link is not working for you (it sometimes gets confused) you can Search the Springer Verlag catalogue looking for ISBN '3-540-41554-8'. Contents Instruction for authors Schedule/Program (new! advanced program) A Satellite Workshop on Data Exchange Formats will be held on 20 Sept 2000. (new!) Deadlines Colonial Williamsburg Information Registration and Hotel Accommodation (updated 20 Aug 2000) Location (new! travel info)

98. Burton's Bookmarks: Graph Theory Wireless XML Bookmark folder Top graph theory MaxFlow ProblemFord-Fulkerson Algorithm; Ford-Fulkerson method; augmenting path; http://relativity.yi.org/bookmarks/Graph_Theory/index.shtml

home stack about bio ... XML Bookmark folder: Top Graph Theory Max-Flow Problem: Ford-Fulkerson Algorithm Ford-Fulkerson method augmenting path Ford-Fulkerson Max Flow Labeling Algorithm ... Kevin Bacon shows way to smaller world: mathematician - The game "Six Degrees of Kevin Bacon," in which actors can be connected to one another through their appearances in films with actor Kevin Bacon, works because Hollywood movies are a "small world," in mathematical terms. It's a world where actors are grouped into clusters the casts of each film and there are many interconnections among the clusters. jakarta-commons-sandbox/graph2 TouchGraph: Development - TouchGraph is being developed in an open source environment in order to expedite the matuturation of this technology, and to allow it to be used as broadly as possible.The field of Graph Based Interfaces is still in it's infancy, partially because the main commercial applications such as InXight, TheBrain, and ThinkMap, are poprietary and thus do not allow for outside experimentation and modification of their code. burton@openprivacy.org

99. Journal Of Graph Theory graph theory (2nd Edition)by Douglas Brent West (Hardcover August 23, 2000) Avg. Customer Review http://journals.wiley.com/0364-9024/

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

100. CTW2001 Topics are graph theory and discrete algorithms (both deterministic and random) and their applications in operations research and computer science. Institute of Mathematics, Center of Applied Computer Science, University of Cologne; 68 June 2001. http://www.zaik.uni-koeln.de/AFS/conferences/CTW2001/CTW2001.html

1st CologneTwenteWorkshop on Graphs and Combinatorial Optimization CTW 2001 Institute of Mathematics and Institute of Computer Science Center of Applied Computer Science University of Cologne Cologne, Germany June 6-8, 2001 Presentations at the Workshop Following the tradition of previous workshops, a special issue of Discrete Applied Mathematics will be prepared in connection with the recent 1st Cologne/Twente Workshop on Graphs and Combinatorial Optimization. All interested researchers are invited to contribute to this special volume. The topics should relate to the central themes of the workshop (graphs, combinatorial optimization and the design and analysis of algorithms) but are not necessarily restricted to the presentations at the workshop. Theoretical and applied work is equally welcome. All articles will be thoroughly refereed according to the standards of Discrete Applied Mathematics. Submission deadline is: 30 September, 2001 You may send your submission electronically (ps-file) to the address ctw@zpr.uni-koeln.de

Page 5     81-100 of 143    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20