Graph theory and its applications, second edition

Graph Theory and Its Applications, Second Edition

Volumn , Issue , 2005, Pages 1-800

  Gross, Jonathan L ^a   Yellen, Jay ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b ROLLINS COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85128869281     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420057140     Document Type: Book

References (206)

1. J.A. Gallian, Contemporary Abstract Algebra, Second Edition, D. C. Heath, 1990.
2. R.L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Second Edition, Addison-Wesley, 1994.
3. S. Maclane and G. Birkhoff, Algebra, Macmillan, 1967.
4. A.V. Aho, J. E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983.
5. S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison- Wesley, 1983.
6. S. Even, Graph Algorithms, Computer Science Press, 1979.
7. M.R. Garey and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
8. J. Gruska, Foundations of Computing, Thomson, 1997.
9. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
10. R. Sedgewick, Algorithms, Addison-Wesley, 1988.
11. H.S. Wilf, Algorithms and Complexity, Prentice-Hall, 1986.
12. K.P. Bogart, Introductory Combinatorics, Third Edition, Academic Press, 2000.
13. R.A. Brualdi, Introductory Combinatorics, Fourth Edition, Prentice Hall, 2004.
14. J.G. Michaels and K.H. Rosen (Eds.), Applications of Discrete Mathematics, McGraw-Hill, 1991.
15. A. Polimeni and H.J. Straight, Foundations of Discrete Mathematics, Brooks/Cole, 1990.
16. F.S. Roberts, Applied Combinatorics, Prentice-Hall, 1984.
17. K.H. Rosen, Discrete Mathematics and Its Applications, Fifth Edition, McGraw-Hill, 2003.
18. H.J. Straight, Combinatorics: An Invitation, Brooks/Cole 1993.
19. A. Tucker, Applied Combinatorics, Fourth Edition, John Wiley & Sons, 2001.
20. B. Berge, Graphs, North-Holland, 1985.
21. N.L. Biggs, E. K. Lloyd, and R.J. Wilson, Graph Theory 1736-1936, Oxford, 1986.
22. B. Bollobas, Modern Graph Theory, Springer, 1998.
23. J.A. Bondy and U.S. R. Murty, Graph Theory With Applications, American Elsevier, 1976.
24. G. Chartrand and L. Lesniak, Graphs & Digraphs, Fourth Edition, CRC Press, 2004.
25. G. Chartrand and P. Zhang, Introduction to Graph Theory, McGraw Hill, 2005.
26. R. Diestel, Graph Theory, Springer-Verlag, Second Edition, 2000.
27. A. Gibbons, Algorithmic Graph Theory, Cambridge University Press, 1985.
28. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
29. R. Gould, Graph Theory, Benjamin/Cummings, 1988.
30. J.L. Gross and J. Yellen, eds, Handbook of Graph Theory, CRC Press, 2004.
31. F. Harary, Graph Theory, Addison-Wesley, 1969.
32. K. Thulasiraman and M.N. S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, 1992.
33. D.B. West, Introduction to Graph Theory, Second Edition, Prentice-Hall, 2001.
34. R.J. Wilson, Introduction to Graph Theory, Addison Wesley Longman, 1996.
35. R.J. Wilson and J.J. Watkins, Graphs: An Introductory Approach, John Wiley & Sons, 1990.
36. J.L. Gross and T.W. Tucker, Topological Graph Theory, Dover, 2001.
37. W.S. Massey, Algebraic Topology: An Introduction, Harbrace, 1967.
38. G. Ringel, Map Color Theorem, Springer, 1974.
39. A.T. White, Graphs, Groups and Surfaces, Revised Edition, North-Holland, 1984.
40. F.S. Roberts, Applied Combinatorics, Prentice-Hall, 1984.
41. R.J. Wilson, History of Graph Theory, §1.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
42. R.J. Wilson and J.J. Watkins, Graphs: An Introductory Approach, John Wiley & Sons, 1990.
43. B.D. McKay, Computer reconstruction of small graphs, J. Graph Theory 1 (1977), 281-283.
44. A. Nijenhuis, Note on the unique determination of graphs by proper subgraphs, Notices Amer. Math. Soc. 24 (1977), A-290.
45. V. Aho, J. E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983.
46. D.A. Huffman, A method for the construction of minimum-redundancy codes, Proc. IRE 40 (1952), 1098-1101.
47. A.V. Aho, J. E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983.
48. S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison- Wesley, 1983.
49. E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959), 269-271.
50. R.W. Floyd, Algorithm 97: shortest path, Comm. ACM 5:6 (1962), 345.
51. J.B. Kruskal Jr., On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings AMS 7, 1 (1956).
52. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
53. J.G. Oxley, Matroid Theory, Oxford, 1992.
54. R.C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957).
55. R. Sedgewick, Algorithms, Addison-Wesley, 1988.
56. K. Thulasiraman and M.N. S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, 1992.
57. D.J. A. Welsh, Matroid Theory, Academic Press, 1976.
58. R.J. Wilson, Introduction to Graph Theory, Addison Wesley Longman, 1996.
59. A.V. Aho, J. E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983.
60. S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison- Wesley, 1983.
61. L.R. Ford and D.R. Fulkerson, Maximal flow through a network, Ganad. J. Math. 8 (1956), 399-404.
62. F. Harary, The maximum connectivity of a graph, Proc. Natl. Acad. Sci., U.S. 48 (1962), 1142-1146.
63. K. Thulasiraman and M.N. S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, 1992.
64. W.T. Tutte, A theory of 3-connected graphs, Indag. Math. 23 (1961), 441-455.
65. H. Crowder and M.W. Padberg, Solving large-scale symmetric traveling salesman problem to optimality, Management Science 26 (1980), 495-509.
66. G.B. Dantzig, D. R. Fulkerson, and S.M. Johnson, Solution of a large-scale traveling salesman problem, Oper. Res. 2 (1954), 393-410.
67. N.G. deBruijn and T. Ehrenfest, Circuits and trees in Oriental graphs, Simon Stevin 28 (1951), 203-217.
68. G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952), 69-81.
69. J. Edmonds, The Chinese postman problem, Oper. Res. 13-1 (1965), 373.
70. J. Edmonds and E.L. Johnson, Matching Euler tours and the Chinese postman, Math. Programming 5 (1973), 88-124.
71. H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 1, Ann. Discrete Math 45 North-Holland, Amsterdam, 1990.
72. H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 2, Ann. Discrete Math 50 North-Holland, Amsterdam, 1991.
73. H. Fleischner, Eulerian Graphs, §4.2 in Handbook of Graph Theory, editors, J. L. Gross and J. Yellen, CRC Press, Boca Raton, FI, 2004.
74. G.N. Frederickson, Approximation algorithms for some postman problems, JACM 26 (1979), 538-554.
75. M. Guan, Graphic programming using odd and even points, Chinese Math. 1 (1962), 273-277.
76. G. Hutchinson, Evaluation of polymer sequence fragment data using graph theory, Bull. Math. Biophys. 31 (1969), 541-562.
77. J.P. Hutchinson and H.S. Wilf, On Eulerian circuits and words with prescribed adjacency patterns, J. Comb. Theory 18 (1975), 80-87.
78. E.L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley, 1985.
79. O. Ore, Note on Hamilton circuits, Amer. Math. Monthly 67 (1960), 55.
80. H. Papadimitriou, On the complexity of edge traversing, JACM 23 (1976), 544-554.
81. H. Papadimitriou and K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.
82. M. Reingold and R.E. Tarjan, On a greedy heuristic for complete matching, SIAM J. Computing 10 (1981), 676-681.
83. H. Robinson, Graph Theory Techniques in Model-Based Testing, 1999 International Conference on Testing Computer Software.
84. J. Rosenkrantz, R. E. Stearns, and P.M. Lewis, An analysis of several heuristics for the travelling salesman problem, SIAM J. Comput. 6 (1977), 563-581.
85. S. Sahni and T. Gonzalez, P-complete approximation problems, JACM 23 (1976), 555-565.
86. C.A. B. Smith and W.T. Tutte, On unicursal paths in a network of degree 4, Amer. Math. Monthly 48 (1941), 233-237.
87. A.C. Tucker and L. Bodin, A model for municipal street-sweeping operations, in W.F. Lucas, F. S. Roberts, and R.M. Thrall (Eds.), Discrete and System Models 3, of Modules in Applied Mathematics, Springer-Verlag (1983), 76-111.
88. D.R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. 24 (1972), 739-755.
89. J.A. Bondy and U.S. R. Murty, Graph Theory With Applications, American Elsevier, 1976.
90. J.L. Gross and R.H. Rosen, A linear-time planarity algorithm for 2-complexes, J. Assoc. Comput. Mach. 20 (1979), 611-617.
91. J.L. Gross and R.H. Rosen, A combinatorial characterization of planar 2- complexes, Colloq. Math. 44 (1981), 241-247.
92. J. Hopcroft and R.E. Tarjan, Efficient Planarity Testing, JACM 21 (1974), 549-568.
93. M.H. A. Newman, Elements of the Topology of Plane Sets of Points, Cambridge University Press, 1954.
94. C. Thomassen, Planarity and duality of finite and infinite graphs, J. Combin. Theory Ser. B 29 (1980), 244-271.
95. C. Thomassen, Kuratowski's theorem, J. Graph Theory 5 (1981), 225-241.
96. K. Wagner, Bemerkungen zum Vierfarbenproblem, Jber. Deutch. Math. Verien. 46 (1936), 21-22.
97. D.B. West, Introduction to Graph Theory, Second Edition, Prentice-Hall, 2001.
98. R.J. Wilson, History of Graph Theory, §1.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
99. A. Aggarwal and J. Wein, Computational Geometry, MIT LCS Research Seminar Series 3, 1988.
100. J. Chen, Algorithms and Complexity in Computational Geometry, §13.5 of Handbook of Discrete and Combinatorial Mathematics (ed. K. H. Rosen), CRC Press, 2000.
101. S.M. Coxeter and W.O. J. Moser, Generators and Relators for Discrete Groups, Third Edition, Springer-Verlag, 1972.
102. P. Eades and S. Whitesides, The realization problem for Euclidean minimum spanning trees is NP-hard, Algorithmica 16 (1996), 60-82. (Special issue on Graph Drawing, ed. by G. Di Battista and R. Tamassia.)
103. L. Gross and T.W. Tucker, Topological Graph Theory, Dover, 2001. (First Edition, Wiley-Interscience, 1987.)
104. G. Liotta and G. Di Battista, Computing proximity drawings of trees in the 3-dimensional space, pp 239-250 in Proc. 4th Workshop Algorithms Data Struct., Lecture Notes Comput. Sci. vol. 955, Springer-Verlag, 1995.
105. G. Liotta and R. Tamassia, Drawings of Graphs, §10.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
106. W.S. Massey, Algebraic Topology: An Introduction, Springer-Verlag, 1989. (First Edition: Harcourt Brace & World, 1967.)
107. C. Monma and S. Suri, Transitions in geometric minimum spanning trees, Discrete Comput. Geom. 8 (1992), 265-293.
108. I. Appel and W. Haken, Every planar map is four-colorable, Bull. Amer. Math. Soc. 82 (1976), 711-712.
109. F. Bäbler, Uber die Zerlegung regulärer Streckencomplexe ungerader Ordnung, Comment. Math. Helv. 10 (1938), 275-287.
110. W. Beineke, Derived graphs and digraphs, in Beitrage zur Graphentheorie Tuebner, 1968.
111. D. Brelaz, New methods to color the vertices of a graph, Commun. ACM 22 (1979), 251-256.
112. W. Carter, A survey of practical applications of examination timetabling algorithms, Oper. Res. 34 (1986), 193-202.
113. R. Carey and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-completeness, W. H. Freeman, 1979.
114. L. Kiaer and J. Yellen, Weighted graphs and university course timetabling, Computers and Oper. Res. 19 (1992), 59-67.
115. D. König, Uber Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 (1916), 453-465.
116. L. Loväsz, Three short proofs in graph theory, J. Combin. Theory Ser. B 19 (1975), 269-271.
117. B. Manvel, Coloring large graphs, Proceedings of the 1981 Southeastern Conference on Graph Theory Combinatorics and Computer Science, 1981.
118. J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193-220.
119. Robertson, D. P. Sanders, P. Seymour, and R. Thomas, The four- colour theorem, J. Combin. Theory Ser. B 70 (1997), 166-183.
120. C.A. Anderson, L. Langley, J. R. Lundgren, P. A. McKenna and S.K. Merz, New classes of p-competition graphs and tolerance competition graphs, Congr. Numer. 100 (1994), 97-107.
121. C. Berge, Theory of Graphs and its Applications, Methuen, 1962.
122. C. Berge, Graphs and Fypergraphs, North-Holland, 1973.
123. H. Bielak and M.M. Syslo, Peripheral vertices in graphs, Studia Sci. Math. Hungar. 18 (1983), 269-275.
124. R.C. Brigham, Bandwidth, §9.4 in Ffandbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
125. R.C. Brigham, J. R. Carrington and R.P. Vitray, Bipartite graphs and absolute difference tolerances, Ars Combin. 54 (2000), 3-27.
126. R.C. Brigham and R.D. Dutton, A compilation of relations between graph invariants, Networks 15 (1985), 73-107.
127. R.C. Brigham, F. R. McMorris and R.P. Vitray, Tolerance competition graphs, Linear Algebra Appl. 217 (1995), 41-52.
128. R.C. Brigham, F. R. McMorris and R.P. Vitray, Two-tolerance competition graphs, Discrete Appl. Math 66 (1996), 101-108.
129. F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, 1990.
130. F.R. K. Chung, Labelings of graphs, Selected Topics in Graph Theory 3, Academic Press Limited, San Diego, CA (1988), 151-168.
131. Z. Chinn, J. Chvatalova, A. K. Dewdney, and N.E. Gibbs, The bandwidth problem for graphs and matrices-a survey, Journal of Graph Theory 6 (1982), 223-254.
132. J. Chvatalova, A. K. Dewdney, N. E. Gibbs, and R.R. Korfhage, The bandwidth problem for graphs: a collection of recent results, Research Report 24, Department of Computer Science, University of Western Ontario, (1975).
133. G. Chartrand, O. R. Oellermann, S. Tian, and H.B. Zou, Steiner distance in graphs, Casopis Pro Pest. Mat. 114 (1989), 399-410.
134. G. Chartrand and P. Zhang, Distance in Graphs, §9.1 in Plandhook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
135. J.E. Cohen, Food Webs and Niche Space, Princeton University Press, 1978.
136. D. Dutton and R.C. Brigham, A characterization of competition graphs, Discrete Appl. Math. 6 (1983), 315-317.
137. P. Erdos, A. W. Goodman and L. Posa, The representation of a graph by set intersections, Canad. J. Math. 18 (1966), 106-112.
138. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Comb. Theory, Ser. B 16 (1974), 47-56.
139. M.C. Golumbic and C.L. Monma, A generalization of interval graphs with tolerances, Congr. Numer. 35 (1982), 321-331.
140. M.C. Golumbic, C. L. Monma and W.T. Trotter, Tolerance graphs, Discrete Appl. Math. 9 (1984), 157-170.
141. M.C. Golumbic and A.N. Trenk, Tolerance Graphs, Cambridge University Press, 2003.
142. L.H. Harper, Optimal assignment of numbers to vertices, Journal of SIAM 12 (1964), 131-135.
143. F. Harary and R.Z. Norman, The dissimilarity characteristic of Husimi trees, Ann. of Math. 58 (1953), 134-141.
144. M.A. Henning, O. R. Oellermann, and H.C. Swart, On Steiner radius and Steiner diameter of a graph, Ars Combin. 29 (1990), 13-19.
145. M.A. Henning, O. R. Oellermann, and H.C. Swart, On vertices with maximum Steiner eccentricity in graphs, Graph Theory Combinatorics, Algorithms and Applications (eds. Y. Alav, F. R. K. Chung, R. L. Graham, and D.F. Hsu), SIAM Publications (1991), 393-403.
146. M.S. Jacobson, F. R. McMorris and H.M. Mulder, An introduction to tolerance intersection graphs, In Graph Theory, Combinatorics and Applications (Y. Alavi, et ah, Eds.) Wiley Interscience, vol. 2 (1991), pp. 705-723.
147. M.S. Jacobson, F. R. McMorris and E.R. Scheinerman, General results on tolerance intersection graphs, J. Graph Theory 15 (1991), 573-577.
148. Y. Lai and K. Williams, A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs, Journal of Graph Theory 31 (1999), 75-94.
149. J.R. Lundgren and J.S. Maybee, A characterization of graphs of competition number m, Discrete Appl. Math. 6 (1983), 319-322.
150. E. Szpilrajn-Marczewski, Sur deux propriétés des classes d'ensembles, Fund. Math. 33 (1945), 303-307.
151. A. McKee and F.R. McMorris, Topics in Intersection Graph Theory, SIAM monograph, 1999.
152. Z. Miller, Graph layouts, Applications of Discrete Mathematics, J. G. Michaels and K.H. Rosen (Editors), McGraw-Hill, New York (1991), 365-393.
153. O. Ore, Theory of graphs, Amer. Math. Soc. Transi. 38 (1962), 206-212.
154. J.R. Walter, Representations of chordal graphs as subtrees of a tree, Journal of Graph Theory 2 (1978), 265-267.
155. H.B. Walikar, B. D. Acharya, and E. Sampathkumar, Recent developments in the theory of domination in graphs, Mehta Research Institute, Allahabad, MRI Lecture Notes in Math, 1 (1979).
156. B. Bollobas and V. Nikiforov, Extremal Graph Theory, §8.1 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
157. R. Faudree, Ramsey Graph Theory, §8.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
158. R.L. Graham, B. L. Rothschild, and J.H. Spencer, Ramsey Theory, John Wiley & Sons, 1990.
159. R.E. Greenwood and A.M. Gleason, Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-7.
160. P. Turan, On an extremal problem in graph theory (Hungarian), Mat. es Fiz. Lapok 48 (1941), 436-452.
161. N. Wormald, Random Graphs, §8.2 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
162. S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison- Wesley, 1983.
163. J.-C. Bermond and C. Thomassen, Cycles in digraphs: a survey, J. Graph Theory 5 (1981) 1-43.
164. E. Burke, D. de Werra, and J. Kingston, Applications to Timetabling, §5.6 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
165. E. Cinlar, An Introduction to Stochastic Processes, Prentice-Hall, 1975.
166. R. Haggkvist, Hamiltonian cycles in oriented graphs, Combin. Probab. Comput. 2 (1993), 25-32.
167. H.G. Landau, On dominance relations and the structure of animal societies. III. The condition for a score structure, Bull. Math. Biophys. 15 (1953), 143-148.
168. S.B. Maurer, Directed Acyclic Graphs, §3.2 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
169. K.B. Reid, Tournaments: scores, kings, generalizations and special topics, Congressus Numer. 115 (1996), 171-211.
170. H.J. Straight, Combinatorics: An Invitation, Brooks/Cole, 1993.
171. C. Thomassen, Edge-disjoint Hamiltonian paths and cycles in tournaments, Proc. London Math. Soc. 45 (1982), 151-168.
172. K. Thulasiraman and M.N. S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, 1992.
173. C.Q. Zhang, Every regular tournament has two arc-disjoint Hamiltonian cycles, J. Qufu Normal College, Special Issue Oper. Res. (1980), 70-81.
174. J. Edmonds, Paths, trees, and flowers, Canad. J. Math. 17 (1965), 449-467.
175. J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, JACM 19 (1972), 248-264.
176. S. Even, Graph Algorithms, Computer Science Press, 1979.
177. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton Univerity Press, 1962.
178. D. König, Uber Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 (1916), 453-465.
179. E. Minieka, Optimisation Algorithms for Networks and Graphs, Marcel Dekker, 1978.
180. J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193-220.
181. K. Thulasiraman and M.N. S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, 1992.
182. K.P. Bogart, Introductory Combinatorics, Third Edition, Academic Press, 2000.
183. R.A. Brualdi, Introductory Combinatorics, Fourth Edition, Prentice Hall, 2004.
184. F. Harary and E.M. Palmer, Graphical Enumeration, Academic Press, 1973.
185. G. Polya, Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und Chemische Verbindungen, Acta Mathematica 68 (1937), 145-254.
186. J.L. Gross and J. Chen, Algebraic specification of interconnection networks by permutation voltage graph morphisms, Math. Systems Theory 29 (1996), 451-470.
187. J.L. Gross and T.W. Tucker, Generating all graph coverings by permutation voltage assignments, Discrete Math. 18 (1977), 273-283.
188. F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, 1992.
189. S.R. Alpert and J.L. Gross, Components of branched coverings of current graphs, J. Combin. Theory Ser. B 20 (1976), 283-303.
190. R.A. Duke, The genus, regional number, and Betti number of a graph, Canad. J. Math. 18 (1966), 817-822.
191. J. Edmonds, A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc. 7 (1960), A-646.
192. J.R. Edmonds, On the surface duality of linear graphs, J. Res. Nat. Bur. Standards Sect. B (1965), 121-123.
193. M. Furst, J. L. Gross, and L. McGeoch, Finding a maximum-genus graph imbedding, JACM 35 (1988), 523-534.
194. J.L. Gross, Voltage graphs, Discrete Math. 9 (1974), 239-246.
195. J.L. Gross and S.R. Alpert, Branched coverings of graph imbeddings, Bull. Amer. Math. Soc. 79 (1973), 942-945.
196. J.L. Gross and S.R. Alpert, The topological theory of current graphs, J. Combin. Theory Ser. B 17 (1974), 218-233.
197. J.L. Gross and T.W. Tucker, Generating all graph coverings by permutation voltage assignments, Discrete Math. 18 (1977), 273-283.
198. J.L. Gross and T.W. Tucker, Topological Graph Theory, Dover, 2001. (First Edition, Wiley-Interscience, 1987.)
199. L. Heffter, Uber das Problem der Nachbargebiete, Math. Annalen 38 (1891), 477-580.
200. E.A. Nordhaus, B. M. Stewart, and A.T. White, On the maximum genus of a graph, J. Combin. Theory Ser. B 11 (1971), 258-267.
201. E.A. Nordhaus, R. D. Ringeisen, B. M. Stewart, and A.T. White, A Kuratowski-type theorem for the maximum genus of a graph, J. Combin. Theory Ser. B 12 (1972), 260-267.
202. C. Thomassen, The graph genus problem is NP-complete, J. of Algorithms 10 (1989), 568-576.
203. S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing (STOC 71) (1971), 151-158.
204. S. Even, Graph Algorithms, Computer Science Press, 1979.
205. M.R. Carey and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
206. H.S. Wilf, Algorithms and Complexity, Prentice-Hall, 1986.