101. Problems In Signed, Gain, And Biased Graphs Compiled by Thomas Zaslavsky. http://www.math.binghamton.edu/zaslav/Bsg/sgbgprobs.html

Problems in Signed, Gain, and Biased Graphs Compiled by Thomas Zaslavsky This is a fairly miscellaneous and incomplete selection of problems that I happen to have taken an interest in not necessarily an active interest. Some are open and some are solved or partially solved as for example a problem may have been shown to be NP-complete but special cases could still be solved exactly or algorithmically. This list is intended to supplement the many problems in the Bibliography . There is just a small amount of duplication. For the present, the problems here all concern signed graphs. However, many of them have obvious generalizations. References are as cited in the Bibliography . All the terms employed should be defined in the Glossary . If you find any missing, or if you have suggestions for this page, please notify me! NOTE: A PostScript version is available. It is slightly more up-to-date and it is the only one that will be maintained and expanded. I. Direct Measures of Imbalance (June 8-10 1998) Imbalance of a signed graph can be measured in numerous ways. Here are problems concerning some measures that have appeared in the literature. The greatest interest has been in the edge version of frustration. (The problems in part II can be regarded as measuring imbalance in a different way.)

102. Perfect Graphs Conjectures and open problems, maintained at the AIM. http://www.aimath.org/WWN/perfectgraph/

Perfect Graphs This web page highlights some of the conjectures and open problems concerning Perfect Graphs. If you would like to print a hard copy of the whole outline, you can download a dvi postscript or pdf version. Recognition of Perfect Graphs Polynomial Recognition Algorithm Found Interaction Between Skew-Partitions and 2-joins The Perfect-Graph Robust Algorithm Problem ... A Possible New Problem Skew-Partitions Extending a Skew -Partition Graphs Without Skew-Partitions Graphs Without Star Cutsets Finding Skew-Partitions in Berge Graphs ... beta-perfect graphs Partitionable Graphs Perfect, Partitionable, and Kernel-Solvable Graphs Partitionable graphs and odd holes A Property of Partitionable Graphs Small Transversals in Partitionable Graphs ... The Imperfection Ratio Integer Programming Partitionable Graphs as Cutting Planes for Packing Problems? Feasibility/Membership Problem For the Theta Body Balanced Graphs Balanced circulants ... P4-structure and Its Relatives The individual contributions may have problems because converting complicated TeX into a web page is not an exact science. The dvi, ps, or pdf versions are your best bet.

103. Open Problems On Perfect Graphs Unsolved problems on perfect graphs. http://www.cs.concordia.ca/~chvatal/perfect/problems.html

PERFECT PROBLEMS Created on 22 August, 2000 Last updated on 5 July, 2006 In May 2002, the Strong Perfect Graph Conjecture became the Strong Perfect Graph Theorem Details are here. As a part of the 1992 1993 Special Year on Combinatorial Optimization at DIMACS ftp://dimacs.rutgers.edu/pub/perfect/problems.tex If you have information on progress towards solving these problems or complaints in case I did not give credit where credit was due or suggestions for problems to add, please, send them to me Related pages: Problems from the AIM Workshop on Perfect Graphs (compiled by Maria Chudnovsky) A bibliography on perfect graphs Home pages of people interested in perfect graphs This collection is written for people with at least a basic knowledge of perfect graphs. Uninformed neophytes may look up the missing definitions on the web in Alexander Schrijver's lecture notes or in Jerry Spinrad's draft of a book on efficient graph representations etc. or in MathWorld . Books on perfect graphs include M. C. Golumbic, Algorithmic graph theory and perfect graphs.

104. Erdös Number Project - The Erdös Number Project - Oakland University List of people with Erdos number at most 2. http://www.oakland.edu/enp/

105. Tom Whaley Formal development of programs, Steinhaus graphs, parallel computing. http://home.wlu.edu/~whaleyt/

Tom Whaley Department of Computer Science Washington and Lee University General information Professor Department of Computer Science Washington and Lee University Office: 406 Parmly (Science Center) Phone: 540-458-8813 Schedule - Fall 2007 Mon Tue Wed Thur Fri A B 101 L C 101 L D 101 L E F G 101 L H 101 L I 101 L Legend In class Office Gotta life Maybe Current Courses CS 101 - Survey of Computer Science Current Projects Alsos Digital Library for Nuclear Issues

106. Keith Edwards' Home Page Harmonious colourings and achromatic number. http://www.maths.dundee.ac.uk/~kedwards/

Keith Edwards Address: School of Computing University of Dundee Dundee E-mail: Phone: Research Interests: Graph Theory Harmonious Colourings and Achromatic Number Includes a detailed bibliography Graph Colourings Enumeration Problems Algorithms Algorithms for Graphs Problems NP-Completeness Links of interest University of Dundee Home Page School of Computing Maths Dept. Edinburgh Mathematical Society ... Tex archive This page is the personal responsibility of Keith Edwards. The views expressed here do not necessarily represent the official views of the University.

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 6     101-106 of 106    Back | 1  | 2  | 3  | 4  | 5  | 6