SOME APPLICATIONS OF GRAPH THEORY

We review three graph-theoretical concepts: graph coloring, intersection graph, and competition graph. For each, we mention a variety of applications, discuss generalizations of the concept arising from the applications, and describe some recent results and open questions. ∗Fred Roberts thanks the National Science Foundation for its support under grant NSFSBR-9709134 to Rutgers University. He thanks the Combinatorial and Computational Mathematics Center at Pohang University of Science and Technology for sponsoring the conference that led to this paper and offers his congratulations and best wishes for Com2Mac’s success.

[1]  J. Richard Lundgren,et al.  The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs , 1995, Ars Comb..

[2]  Michael S. Jacobson.  On the p-Edge Clique Cover Number of Complete Bipartite Graphs , 1992, SIAM J. Discret. Math..

[3]  Some Mathematics for DNA Restriction Mapping , 1989 .

[4]  Joel E. Cohen,et al.  A stochastic theory of community food webs. IV. Theory of food chain lengths in large webs , 1986, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[5]  Harvey J. Greenberg,et al.  Inverting graphs of rectangular matrices , 1984, Discret. Appl. Math..

[6]  Gerard J. Chang,et al.  The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[7]  Dominic Welsh,et al.  Arrangements, Channel Assignments, and Associated Polynomials , 1999 .

[8]  C Fishburn Peter,et al.  Minimal Forbidden Graphs for L(2,1)-Colorings , 2000 .

[9]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[10]  Harvey J. Greenberg,et al.  Inverting Signed Graphs , 1984 .

[11]  Denise Sakai Troxell.  Labeling Chordal Graphs: Distance Two Condition , 1994, SIAM Journal on Discrete Mathematics.

[12]  Fred S. Roberts,et al.  ON THE MOBILE RADIO FREQUENCY ASSIGNMENT PROBLEM AND THE TRAFFIC LIGHT PHASING PROBLEM , 1979 .

[13]  L. G. Anderson.  A Simulation Study of Some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications System , 1973, IEEE Trans. Commun..

[14]  S. Benzer.  The fine structure of the gene. , 1962, Scientific American.

[15]  Susan R. Wilson.  INTRODUCTION TO COMPUTATIONAL BIOLOGY: MAPS, SEQUENCES AND GENOMES. , 1996 .

[16]  D. Kendall.  Incidence matrices, interval graphs and seriation in archeology. , 1969 .

[17]  Robert J. Opsut.  On the Computation of the Competition Number of a Graph , 1982 .

[18]  Alan C. Tucker,et al.  An Efficient Test for Circular-Arc Graphs , 1980, SIAM J. Comput..

[19]  Debra D. Scott.  The competition-common enemy graph of a digraph , 1987, Discret. Appl. Math..

[20]  Joel E. Cohen,et al.  Community food webs have scale-invariant structure , 1984, Nature.

[21]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[22]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[23]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

[24]  N. Alon.  Restricted colorings of graphs , 1993 .

[25]  D. Kendall.  Abundance matrices and seriation in archaeology , 1971 .

[26]  A. Tucker,et al.  Perfect Graphs and an Application to Optimizing Municipal Services , 1973 .

[27]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[28]  Arundhati Raychaudhuri.  Further Results on T-Coloring and Frequency Assignment Problems , 1994, SIAM J. Discret. Math..

[29]  S. Benzer.  ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[31]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

[32]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..

[33]  Li Sheng,et al.  Phylogeny Numbers , 1998, Discret. Appl. Math..

[34]  J. E. Cohen,et al.  Food webs and niche space. , 1979, Monographs in population biology.

[35]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[36]  David G. Kendall,et al.  Some problems and methods in statistical archaeology , 1969 .

[37]  Peisen Zhang,et al.  An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA , 1994, Comput. Appl. Biosci..

[38]  J. Scott Provan.  Determinacy in Linear Systems and Networks , 1983 .

[39]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[40]  Dan Gusfield.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[41]  Jerrold R. Griggs,et al.  Interval graphs and maps of DNA , 1986 .

[42]  Frank Harary,et al.  On double and multiple interval graphs , 1979, J. Graph Theory.

[43]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[44]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[45]  John S. Maybee,et al.  Interval competition graphs of symmetric diagraphs , 1993, Discret. Math..

[46]  Charles Cable,et al.  Some recent results on niche graphs , 1991, Discret. Appl. Math..

[47]  Edward Szpilrajn-Marczewski.  Sur deux propriétés des classes d'ensembles , 1945 .

[48]  Douglas B. West,et al.  Extremal Values of the Interval Number of a Graph , 1980, SIAM J. Matrix Anal. Appl..

[49]  Margaret B. Cozzens,et al.  Higher and multi-dimensional analogues of interval graphs , 1981 .

[50]  J. E. Cohen,et al.  Trophic links of community food webs. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[51]  Fred S. Roberts,et al.  A characterization of competition graphs of arbitrary digraphs , 1983, Discret. Appl. Math..

[52]  Zoltán Füredi,et al.  Extremal problems concerning Kneser graphs , 1986, J. Comb. Theory, Ser. B.

[53]  Zoltán Füredi.  Competition Graphs and Clique Dimensions , 1990, Random Struct. Algorithms.

[54]  John P. Georges,et al.  On the size of graphs labeled with a condition at distance two , 1996, J. Graph Theory.

[55]  Charles M. Newman,et al.  A stochastic theory of community food webs I. Models and aggregated data , 1985, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[56]  Tao Jiang,et al.  Mapping Clones with a Given Ordering or Interleaving , 1997, SODA '97.

[57]  Geoffrey Zweig,et al.  Physical mapping of chromosomes using unique probes , 1994, SODA '94.

[58]  Fred S. Roberts,et al.  Competition Numbers of Graphs with a Small Number of Triangles , 1997, Discret. Appl. Math..

[59]  Dale Skrien.  Chronological orderings of interval graphs , 1984, Discret. Appl. Math..

[60]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[61]  Jeremy P. Spinrad.  Circular-arc graphs with clique cover number two , 1988, J. Comb. Theory, Ser. B.

[62]  Suzanne M. Seager,et al.  Niche graphs , 1989, Discret. Appl. Math..

[63]  J. E. Cohen,et al.  Food webs and the dimensionality of trophic niche space. , 1977, Proceedings of the National Academy of Sciences of the United States of America.

[64]  Margaret B. Cozzens,et al.  Consecutive One’s Properties for Matrices and Graphs Including Variable Diagonal Entries , 1989 .

[65]  Margit Voigt,et al.  List colourings of planar graphs , 2006, Discret. Math..

[66]  Li Sheng,et al.  Phylogeny numbers for graphs with two triangles , 2000, Discret. Appl. Math..

[67]  John S. Maybee,et al.  A characterization of graphs of competition number m , 1983, Discret. Appl. Math..

[68]  Ronald D. Dutton,et al.  A characterization of competition graphs , 1983, Discret. Appl. Math..

[69]  Suh-Ryung Kim,et al.  The Competition Number and its Variants , 1993 .

[70]  Joel E. Cohen,et al.  A stochastic theory of community food webs II. Individual webs , 1985, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[71]  Joel E. Cohen,et al.  A Stochastic Theory of Community Food Webs , 1990 .

[72]  Harvey J. Greenberg.  APPENDIX 2 – GRAPH-THEORETIC FOUNDATIONS OF COMPUTER-ASSISTED ANALYSIS , 1981 .

[73]  Alan Tucker,et al.  Circular arc graphs: New uses and a new algorithm , 1978 .

[75]  Jerrold R. Griggs.  Extremal values of the interval number of a graph, II , 1979, Discret. Math..

[76]  K. Brooks Reid,et al.  The domination and competition graphs of a tournament , 1998, J. Graph Theory.

[77]  Li Sheng,et al.  Tagged Probe Interval Graphs , 2001, J. Comb. Optim..

[78]  Peter C. Fishburn,et al.  Interval graphs and interval orders , 1985, Discret. Math..

[79]  Fred S. Roberts,et al.  INDIFFERENCE AND SERIATION , 1979 .

[81]  Chi Wang,et al.  Competitive inheritance and limitedness of graphs , 1995, J. Graph Theory.

[82]  Zsolt Tuza,et al.  New trends in the theory of graph colorings: Choosability and list coloring , 1997, Contemporary Trends in Discrete Mathematics.

[83]  F. Roberts.  Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. , 1976 .

[84]  J. Richard Lundgren,et al.  Niche graphs and mixed pair graphs of tournaments , 1999, J. Graph Theory.

[85]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[86]  David G. Kendall,et al.  A mathematical approach to seriation , 1970, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[87]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[88]  J. Georges,et al.  On the size of graphs labeled with condition at distance two , 1996 .

[89]  K. Stoffers.  Scheduling of traffic lights—A new approach☆ , 1968 .

[90]  John P. Georges,et al.  On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..

[91]  Fred S. Roberts,et al.  Food webs, competition graphs, and the boxicity of ecological phase space , 1978 .

[92]  Fred S. Roberts,et al.  T-colorings of graphs: recent results and open problems , 1991, Discret. Math..

[93]  Willem H. Haemers,et al.  On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[94]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[95]  Suzanne M. Seager.  The double competition number of some triangle-free graphs , 1990, Discret. Appl. Math..

[96]  A. Tucker,et al.  Matrix characterizations of circular-arc graphs , 1971 .

[97]  Fred S. Roberts,et al.  (i, J) Competition Graphs , 1991, Discret. Appl. Math..

[98]  Arundhati Raychaudhuri.  Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing , 1992, Discret. Appl. Math..

[99]  Douglas F. Rall,et al.  Associative graph products and their independence, domination and coloring numbers , 1996, Discuss. Math. Graph Theory.

[100]  Fred S. Roberts,et al.  I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications , 1983, Networks.

[101]  Barry A. Tesman.  List T-Colorings of Graphs , 1993, Discret. Appl. Math..

[103]  Harvey J. Greenberg,et al.  Rectangular Matrices and Signed Graphs , 1983 .

[104]  Terry A. McKee,et al.  p-Competition Numbers , 1993, Discret. Appl. Math..

[105]  Haim Kaplan,et al.  Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[106]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[107]  V. Klee.  What Are the Intersection Graphs of Arcs in a Circle , 1969 .

[108]  S. Stahl.  n-Tuple colorings and associated graphs , 1976 .

[109]  John P. Georges,et al.  Relating path coverings to vertex labellings with a condition at distance two , 1994, Discret. Math..

[110]  Lee Aaron Newberg,et al.  Physical mapping of chromosomes: A combinatorial problem in molecular biology , 1995, SODA '93.

[111]  Chi Wang.  Competition graphs and resource graphs of digraphs , 1995, Ars Comb..

[112]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[113]  Fred S. Roberts,et al.  Optimal I-Intersection assignments for graphs: A linear programming approach , 1983, Networks.

[114]  Alan Tucker,et al.  Characterizing circular-arc graphs , 1970 .

[115]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[116]  Joel E. Cohen,et al.  A stochastic theory of community food webs. III. Predicted and observed lengths of food chains , 1986, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[117]  Haim Kaplan,et al.  Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques , 1996, SIAM J. Comput..

[118]  Jeremy P. Spinrad,et al.  An O(n2 algorithm for circular-arc graph recognition , 1993, SODA '93.

[119]  J. Richard Lundgren,et al.  Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs , 1989 .

[120]  F. Roberts.  Measurement Theory with Applications to Decisionmaking, Utility, and the Social Sciences: Measurement Theory , 1984 .

[121]  Alan Tucker,et al.  Structure theorems for some circular-arc graphs , 1974, Discret. Math..

[122]  Lawrence Hubert,et al.  SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES , 1974 .

[123]  Denise Sakai,et al.  Labeling Chordal Graphs: Distance Two Condition , 1994 .

[124]  Hans L. Bodlaender,et al.  On Intervalizing K-colored Graphs for DNA Physical Mapping , 1996, Discret. Appl. Math..