-
2
-
-
0004155526
-
-
Second Edition, Addison-Wesley
-
R.L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Second Edition, Addison-Wesley, 1994.
-
(1994)
Concrete Mathematics: A Foundation for Computer Science
-
-
Graham, R.L.1
Knuth, D.E.2
Patashnik, O.3
-
19
-
-
0004264649
-
-
Fourth Edition, John Wiley & Sons
-
A. Tucker, Applied Combinatorics, Fourth Edition, John Wiley & Sons, 2001.
-
(2001)
Applied Combinatorics
-
-
Tucker, A.1
-
20
-
-
0004225467
-
-
North-Holland
-
B. Berge, Graphs, North-Holland, 1985.
-
(1985)
Graphs
-
-
Berge, B.1
-
26
-
-
0003677229
-
-
Springer-Verlag, Second Edition
-
R. Diestel, Graph Theory, Springer-Verlag, Second Edition, 2000.
-
(2000)
Graph Theory
-
-
Diestel, R.1
-
39
-
-
85128862897
-
-
Groups and Surfaces, Revised Edition, North-Holland.
-
A.T. White, Graphs, Groups and Surfaces, Revised Edition, North-Holland, 1984.
-
(1984)
Graphs
-
-
White, A.T.1
-
41
-
-
84983564602
-
-
eds., J. L. Gross and J. Yellen, CRC Press.
-
R.J. Wilson, History of Graph Theory, §1.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
-
(2004)
History of Graph Theory, §1.3 in Handbook of Graph Theory
-
-
Wilson, R.J.1
-
43
-
-
0041014852
-
Computer reconstruction of small graphs
-
B.D. McKay, Computer reconstruction of small graphs, J. Graph Theory 1 (1977), 281-283.
-
(1977)
J. Graph Theory
, vol.1
, pp. 281-283
-
-
McKay, B.D.1
-
44
-
-
84947456848
-
Note on the unique determination of graphs by proper subgraphs
-
A. Nijenhuis, Note on the unique determination of graphs by proper subgraphs, Notices Amer. Math. Soc. 24 (1977), A-290.
-
(1977)
Notices Amer. Math. Soc
, vol.24
, pp. A290
-
-
Nijenhuis, A.1
-
46
-
-
84938015047
-
A method for the construction of minimum-redundancy codes
-
D.A. Huffman, A method for the construction of minimum-redundancy codes, Proc. IRE 40 (1952), 1098-1101.
-
(1952)
Proc. IRE
, vol.40
, pp. 1098-1101
-
-
Huffman, D.A.1
-
49
-
-
34147120474
-
A note on two problems in connexion with graphs
-
E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959), 269-271.
-
(1959)
Numerische Mathematik
, vol.1
, pp. 269-271
-
-
Dijkstra, E.W.1
-
50
-
-
84945709831
-
Algorithm 97: shortest path
-
R.W. Floyd, Algorithm 97: shortest path, Comm. ACM 5:6 (1962), 345.
-
(1962)
Comm. ACM
, vol.5
, Issue.6
, pp. 345
-
-
Floyd, R.W.1
-
51
-
-
70350674995
-
On the shortest spanning subtree of a graph and the traveling salesman problem
-
J.B. Kruskal Jr., On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings AMS 7, 1 (1956).
-
(1956)
Proceedings AMS
, vol.7
, pp. 1
-
-
Kruskal, J.B.1
-
54
-
-
84911584312
-
Shortest connection networks and some generalizations
-
R.C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957).
-
(1957)
Bell System Technical Journal
, vol.36
-
-
Prim, R.C.1
-
58
-
-
0003736074
-
Introduction to Graph Theory
-
Addison Wesley Longman
-
R.J. Wilson, Introduction to Graph Theory, Addison Wesley Longman, 1996.
-
(1996)
-
-
Wilson, R.J.1
-
61
-
-
0001261128
-
Maximal flow through a network
-
L.R. Ford and D.R. Fulkerson, Maximal flow through a network, Ganad. J. Math. 8 (1956), 399-404.
-
(1956)
Ganad. J. Math
, vol.8
, pp. 399-404
-
-
Ford, L.R.1
Fulkerson, D.R.2
-
62
-
-
0002395291
-
The maximum connectivity of a graph
-
F. Harary, The maximum connectivity of a graph, Proc. Natl. Acad. Sci., U.S. 48 (1962), 1142-1146.
-
(1962)
Proc. Natl. Acad. Sci., U.S.
, vol.48
, pp. 1142-1146
-
-
Harary, F.1
-
64
-
-
0000661206
-
A theory of 3-connected graphs
-
W.T. Tutte, A theory of 3-connected graphs, Indag. Math. 23 (1961), 441-455.
-
(1961)
Indag. Math
, vol.23
, pp. 441-455
-
-
Tutte, W.T.1
-
65
-
-
0000546002
-
Solving large-scale symmetric traveling salesman problem to optimality
-
H. Crowder and M.W. Padberg, Solving large-scale symmetric traveling salesman problem to optimality, Management Science 26 (1980), 495-509.
-
(1980)
Management Science
, vol.26
, pp. 495-509
-
-
Crowder, H.1
Padberg, M.W.2
-
66
-
-
0000454153
-
Solution of a large-scale traveling salesman problem
-
G.B. Dantzig, D. R. Fulkerson, and S.M. Johnson, Solution of a large-scale traveling salesman problem, Oper. Res. 2 (1954), 393-410.
-
(1954)
Oper. Res.
, vol.2
, pp. 393-410
-
-
Dantzig, G.B.1
Fulkerson, D.R.2
Johnson, S.M.3
-
67
-
-
0001353507
-
Circuits and trees in Oriental graphs
-
N.G. deBruijn and T. Ehrenfest, Circuits and trees in Oriental graphs, Simon Stevin 28 (1951), 203-217.
-
(1951)
Simon Stevin
, vol.28
, pp. 203-217
-
-
DeBruijn, N.G.1
Ehrenfest, T.2
-
68
-
-
84960584723
-
Some theorems on abstract graphs
-
G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952), 69-81.
-
(1952)
Proc. London Math. Soc.
, vol.2
, pp. 69-81
-
-
Dirac, G.A.1
-
69
-
-
0040873436
-
The Chinese postman problem
-
J. Edmonds, The Chinese postman problem, Oper. Res. 13-1 (1965), 373.
-
(1965)
Oper. Res.
, vol.13
, Issue.1
, pp. 73
-
-
Edmonds, J.1
-
70
-
-
0002293349
-
Matching Euler tours and the Chinese postman
-
J. Edmonds and E.L. Johnson, Matching Euler tours and the Chinese postman, Math. Programming 5 (1973), 88-124.
-
(1973)
Math. Programming
, vol.5
, pp. 88-124
-
-
Edmonds, J.1
Johnson, E.L.2
-
71
-
-
0003415585
-
-
Vol. 1, Ann. Discrete Math 45 North-Holland, Amsterdam
-
H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 1, Ann. Discrete Math 45 North-Holland, Amsterdam, 1990.
-
(1990)
Eulerian Graphs and Related Topics, Part 1
-
-
Fleischner, H.1
-
72
-
-
0003415585
-
-
Vol. 2, Ann. Discrete Math 50 North-Holland, Amsterdam
-
H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 2, Ann. Discrete Math 50 North-Holland, Amsterdam, 1991.
-
(1991)
Eulerian Graphs and Related Topics, Part 1
-
-
Fleischner, H.1
-
73
-
-
85128826650
-
-
editors, J. L. Gross and J. Yellen, CRC Press, Boca Raton, FI
-
H. Fleischner, Eulerian Graphs, §4.2 in Handbook of Graph Theory, editors, J. L. Gross and J. Yellen, CRC Press, Boca Raton, FI, 2004.
-
(2004)
Eulerian Graphs, §4.2 in Handbook of Graph Theory
-
-
Fleischner, H.1
-
74
-
-
0018490910
-
Approximation algorithms for some postman problems
-
G.N. Frederickson, Approximation algorithms for some postman problems, JACM 26 (1979), 538-554.
-
(1979)
JACM
, vol.26
, pp. 538-554
-
-
Frederickson, G.N.1
-
75
-
-
0000682909
-
Graphic programming using odd and even points
-
M. Guan, Graphic programming using odd and even points, Chinese Math. 1 (1962), 273-277.
-
(1962)
Chinese Math
, vol.1
, pp. 273-277
-
-
Guan, M.1
-
76
-
-
0014575620
-
Evaluation of polymer sequence fragment data using graph theory
-
G. Hutchinson, Evaluation of polymer sequence fragment data using graph theory, Bull. Math. Biophys. 31 (1969), 541-562.
-
(1969)
Bull. Math. Biophys.
, vol.31
, pp. 541-562
-
-
Hutchinson, G.1
-
77
-
-
0011602356
-
On Eulerian circuits and words with prescribed adjacency patterns
-
J.P. Hutchinson and H.S. Wilf, On Eulerian circuits and words with prescribed adjacency patterns, J. Comb. Theory 18 (1975), 80-87.
-
(1975)
J. Comb. Theory
, vol.18
, pp. 80-87
-
-
Hutchinson, J.P.1
Wilf, H.S.2
-
78
-
-
0003408279
-
-
John Wiley
-
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.
-
(1985)
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
-
-
Lawler, E.L.1
Lenstra, J.K.2
Rinnooy Kan, A.H.G.3
Shmoys, D.4
-
79
-
-
0002297833
-
Note on Hamilton circuits
-
O. Ore, Note on Hamilton circuits, Amer. Math. Monthly 67 (1960), 55.
-
(1960)
Amer. Math. Monthly
, vol.67
, pp. 55
-
-
Ore, O.1
-
80
-
-
0016974616
-
On the complexity of edge traversing
-
H. Papadimitriou, On the complexity of edge traversing, JACM 23 (1976), 544-554.
-
(1976)
JACM
, vol.23
, pp. 544-554
-
-
Papadimitriou, H.1
-
82
-
-
0038304871
-
On a greedy heuristic for complete matching
-
M. Reingold and R.E. Tarjan, On a greedy heuristic for complete matching, SIAM J. Computing 10 (1981), 676-681.
-
(1981)
SIAM J. Computing
, vol.10
, pp. 676-681
-
-
Reingold, M.1
Tarjan, R.E.2
-
84
-
-
0001235540
-
An analysis of several heuristics for the travelling salesman problem
-
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.
-
(1977)
SIAM J. Comput.
, vol.6
, pp. 563-581
-
-
Rosenkrantz, J.1
Stearns, R.E.2
Lewis, P.M.3
-
85
-
-
0016973706
-
P-complete approximation problems
-
S. Sahni and T. Gonzalez, P-complete approximation problems, JACM 23 (1976), 555-565.
-
(1976)
JACM
, vol.23
, pp. 555-565
-
-
Sahni, S.1
Gonzalez, T.2
-
86
-
-
0007228595
-
On unicursal paths in a network of degree 4
-
C.A. B. Smith and W.T. Tutte, On unicursal paths in a network of degree 4, Amer. Math. Monthly 48 (1941), 233-237.
-
(1941)
Amer. Math. Monthly
, vol.48
, pp. 233-237
-
-
Smith, C.A.B.1
Tutte, W.T.2
-
87
-
-
35048893082
-
A model for municipal street-sweeping operations
-
in W.F. Lucas, F. S. Roberts, and R.M. Thrall (Eds.), Springer-Verlag
-
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.
-
(1983)
Discrete and System Models 3, of Modules in Applied Mathematics
, pp. 76-111
-
-
Tucker, A.C.1
Bodin, L.2
-
88
-
-
84962984525
-
Sufficient conditions for circuits in graphs
-
D.R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. 24 (1972), 739-755.
-
(1972)
Proc. London Math. Soc.
, vol.24
, pp. 739-755
-
-
Woodall, D.R.1
-
90
-
-
0018534036
-
A linear-time planarity algorithm for 2-complexes
-
J.L. Gross and R.H. Rosen, A linear-time planarity algorithm for 2-complexes, J. Assoc. Comput. Mach. 20 (1979), 611-617.
-
(1979)
J. Assoc. Comput. Mach.
, vol.20
, pp. 611-617
-
-
Gross, J.L.1
Rosen, R.H.2
-
91
-
-
0346658524
-
A combinatorial characterization of planar 2- complexes
-
J.L. Gross and R.H. Rosen, A combinatorial characterization of planar 2- complexes, Colloq. Math. 44 (1981), 241-247.
-
(1981)
Colloq. Math.
, vol.44
, pp. 241-247
-
-
Gross, J.L.1
Rosen, R.H.2
-
92
-
-
0016117886
-
Efficient Planarity Testing
-
J. Hopcroft and R.E. Tarjan, Efficient Planarity Testing, JACM 21 (1974), 549-568.
-
(1974)
JACM
, vol.21
, pp. 549-568
-
-
Hopcroft, J.1
Tarjan, R.E.2
-
94
-
-
85025535620
-
Planarity and duality of finite and infinite graphs
-
C. Thomassen, Planarity and duality of finite and infinite graphs, J. Combin. Theory Ser. B 29 (1980), 244-271.
-
(1980)
J. Combin. Theory Ser. B
, vol.29
, pp. 244-271
-
-
Thomassen, C.1
-
95
-
-
84989906901
-
Kuratowski's theorem
-
C. Thomassen, Kuratowski's theorem, J. Graph Theory 5 (1981), 225-241.
-
(1981)
J. Graph Theory
, vol.5
, pp. 225-241
-
-
Thomassen, C.1
-
96
-
-
0001855349
-
Bemerkungen zum Vierfarbenproblem
-
K. Wagner, Bemerkungen zum Vierfarbenproblem, Jber. Deutch. Math. Verien. 46 (1936), 21-22.
-
(1936)
Jber. Deutch. Math. Verien.
, vol.46
, pp. 21-22
-
-
Wagner, K.1
-
98
-
-
84983564602
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
R.J. Wilson, History of Graph Theory, §1.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
-
(2004)
History of Graph Theory, §1.3 in Handbook of Graph Theory
-
-
Wilson, R.J.1
-
102
-
-
0001859411
-
The realization problem for Euclidean minimum spanning trees is NP-hard
-
(Special issue on Graph Drawing, ed. by G. Di Battista and R. Tamassia.)
-
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.)
-
(1996)
Algorithmica
, vol.16
, pp. 60-82
-
-
Eades, P.1
Whitesides, S.2
-
103
-
-
0004161410
-
-
Dover, (First Edition, Wiley-Interscience, 1987.)
-
L. Gross and T.W. Tucker, Topological Graph Theory, Dover, 2001. (First Edition, Wiley-Interscience, 1987.)
-
(2001)
Topological Graph Theory
-
-
Gross, L.1
Tucker, T.W.2
-
104
-
-
84958039842
-
Computing proximity drawings of trees in the 3-dimensional space
-
Springer-Verlag
-
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.
-
(1995)
in Proc. 4th Workshop Algorithms Data Struct., Lecture Notes Comput. Sci.
, vol.955
, pp. 239-250
-
-
Liotta, G.1
Di Battista, G.2
-
105
-
-
85128810069
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
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.
-
(2004)
Drawings of Graphs, §10.3 in Handbook of Graph Theory
-
-
Liotta, G.1
Tamassia, R.2
-
106
-
-
0004118098
-
-
Springer-Verlag, (First Edition: Harcourt Brace & World, 1967.)
-
W.S. Massey, Algebraic Topology: An Introduction, Springer-Verlag, 1989. (First Edition: Harcourt Brace & World, 1967.)
-
(1989)
Algebraic Topology: An Introduction
-
-
Massey, W.S.1
-
107
-
-
21144470704
-
Transitions in geometric minimum spanning trees
-
C. Monma and S. Suri, Transitions in geometric minimum spanning trees, Discrete Comput. Geom. 8 (1992), 265-293.
-
(1992)
Discrete Comput. Geom
, vol.8
, pp. 265-293
-
-
Monma, C.1
Suri, S.2
-
108
-
-
84966228398
-
Every planar map is four-colorable
-
I. Appel and W. Haken, Every planar map is four-colorable, Bull. Amer. Math. Soc. 82 (1976), 711-712.
-
(1976)
Bull. Amer. Math. Soc.
, vol.82
, pp. 711-712
-
-
Appel, I.1
Haken, W.2
-
109
-
-
0013524531
-
Uber die Zerlegung regulärer Streckencomplexe ungerader Ordnung
-
F. Bäbler, Uber die Zerlegung regulärer Streckencomplexe ungerader Ordnung, Comment. Math. Helv. 10 (1938), 275-287.
-
(1938)
Comment. Math. Helv.
, vol.10
, pp. 275-287
-
-
Bäbler, F.1
-
111
-
-
0018456690
-
New methods to color the vertices of a graph
-
D. Brelaz, New methods to color the vertices of a graph, Commun. ACM 22 (1979), 251-256.
-
(1979)
Commun. ACM
, vol.22
, pp. 251-256
-
-
Brelaz, D.1
-
112
-
-
0022679486
-
A survey of practical applications of examination timetabling algorithms
-
W. Carter, A survey of practical applications of examination timetabling algorithms, Oper. Res. 34 (1986), 193-202.
-
(1986)
Oper. Res.
, vol.34
, pp. 193-202
-
-
Carter, W.1
-
114
-
-
0026765586
-
Weighted graphs and university course timetabling
-
L. Kiaer and J. Yellen, Weighted graphs and university course timetabling, Computers and Oper. Res. 19 (1992), 59-67.
-
(1992)
Computers and Oper. Res.
, vol.19
, pp. 59-67
-
-
Kiaer, L.1
Yellen, J.2
-
115
-
-
34250966677
-
Uber Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre
-
D. König, Uber Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 (1916), 453-465.
-
(1916)
Math. Ann.
, vol.77
, pp. 453-465
-
-
König, D.1
-
116
-
-
0012883416
-
Three short proofs in graph theory
-
L. Loväsz, Three short proofs in graph theory, J. Combin. Theory Ser. B 19 (1975), 269-271.
-
(1975)
J. Combin. Theory Ser. B
, vol.19
, pp. 269-271
-
-
Loväsz, L.1
-
117
-
-
85128809229
-
-
Proceedings of the 1981 Southeastern Conference on Graph Theory Combinatorics and Computer Science
-
B. Manvel, Coloring large graphs, Proceedings of the 1981 Southeastern Conference on Graph Theory Combinatorics and Computer Science, 1981.
-
(1981)
Coloring large graphs
-
-
Manvel, B.1
-
118
-
-
0001550949
-
Die Theorie der regulären Graphen
-
J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193-220.
-
(1891)
Acta Math.
, vol.15
, pp. 193-220
-
-
Petersen, J.1
-
119
-
-
0031145823
-
The four- colour theorem
-
Robertson, D. P. Sanders, P. Seymour, and R. Thomas, The four- colour theorem, J. Combin. Theory Ser. B 70 (1997), 166-183.
-
(1997)
J. Combin. Theory Ser. B
, vol.70
, pp. 166-183
-
-
Robertson, D.P.S.1
Seymour, P.2
Thomas, R.3
-
120
-
-
0345993908
-
New classes of p-competition graphs and tolerance competition graphs
-
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.
-
(1994)
Congr. Numer.
, vol.100
, pp. 97-107
-
-
Anderson, C.A.1
Langley, L.2
Lundgren, J.R.3
McKenna, P.A.4
Merz, S.K.5
-
124
-
-
85128867438
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
R.C. Brigham, Bandwidth, §9.4 in Ffandbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
-
(2004)
Bandwidth, §9.4 in Ffandbook of Graph Theory
-
-
Brigham, R.C.1
-
125
-
-
0346972074
-
Bipartite graphs and absolute difference tolerances
-
R.C. Brigham, J. R. Carrington and R.P. Vitray, Bipartite graphs and absolute difference tolerances, Ars Combin. 54 (2000), 3-27.
-
(2000)
Ars Combin
, vol.54
, pp. 3-27
-
-
Brigham, R.C.1
Carrington, J.R.2
Vitray, R.P.3
-
126
-
-
0022031852
-
A compilation of relations between graph invariants
-
R.C. Brigham and R.D. Dutton, A compilation of relations between graph invariants, Networks 15 (1985), 73-107.
-
(1985)
Networks
, vol.15
, pp. 73-107
-
-
Brigham, R.C.1
Dutton, R.D.2
-
130
-
-
0037476529
-
-
Academic Press Limited, San Diego, CA
-
F.R. K. Chung, Labelings of graphs, Selected Topics in Graph Theory 3, Academic Press Limited, San Diego, CA (1988), 151-168.
-
(1988)
Labelings of graphs, Selected Topics in Graph Theory 3
, pp. 151-168
-
-
Chung, F.R.K.1
-
131
-
-
84979702392
-
The bandwidth problem for graphs and matrices-a survey
-
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.
-
(1982)
Journal of Graph Theory
, vol.6
, pp. 223-254
-
-
Chinn, Z.1
Chvatalova, J.2
Dewdney, A.K.3
Gibbs, N.E.4
-
132
-
-
0011431888
-
-
Research Report 24, Department of Computer Science, University of Western Ontario
-
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).
-
(1975)
The bandwidth problem for graphs: a collection of recent results
-
-
Chvatalova, J.1
Dewdney, A.K.2
Gibbs, N.E.3
Korfhage, R.R.4
-
133
-
-
0001533844
-
Steiner distance in graphs
-
G. Chartrand, O. R. Oellermann, S. Tian, and H.B. Zou, Steiner distance in graphs, Casopis Pro Pest. Mat. 114 (1989), 399-410.
-
(1989)
Casopis Pro Pest. Mat.
, vol.114
, pp. 399-410
-
-
Chartrand, G.1
Oellermann, O.R.2
Tian, S.3
Zou, H.B.4
-
134
-
-
85128844172
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
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.
-
(2004)
Distance in Graphs, §9.1 in Plandhook of Graph Theory
-
-
Chartrand, G.1
Zhang, P.2
-
136
-
-
0013512564
-
A characterization of competition graphs
-
D. Dutton and R.C. Brigham, A characterization of competition graphs, Discrete Appl. Math. 6 (1983), 315-317.
-
(1983)
Discrete Appl. Math.
, vol.6
, pp. 315-317
-
-
Dutton, D.1
Brigham, R.C.2
-
137
-
-
0000557578
-
The representation of a graph by set intersections
-
P. Erdos, A. W. Goodman and L. Posa, The representation of a graph by set intersections, Canad. J. Math. 18 (1966), 106-112.
-
(1966)
Canad. J. Math.
, vol.18
, pp. 106-112
-
-
Erdos, P.1
Goodman, A.W.2
Posa, L.3
-
138
-
-
41549118299
-
The intersection graphs of subtrees in trees are exactly the chordal graphs
-
F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Comb. Theory, Ser. B 16 (1974), 47-56.
-
(1974)
Journal of Comb. Theory, Ser. B
, vol.16
, pp. 47-56
-
-
Gavril, F.1
-
139
-
-
0009314646
-
A generalization of interval graphs with tolerances
-
M.C. Golumbic and C.L. Monma, A generalization of interval graphs with tolerances, Congr. Numer. 35 (1982), 321-331.
-
(1982)
Congr. Numer.
, vol.35
, pp. 321-331
-
-
Golumbic, M.C.1
Monma, C.L.2
-
142
-
-
0001394447
-
Optimal assignment of numbers to vertices
-
L.H. Harper, Optimal assignment of numbers to vertices, Journal of SIAM 12 (1964), 131-135.
-
(1964)
Journal of SIAM
, vol.12
, pp. 131-135
-
-
Harper, L.H.1
-
143
-
-
0001448098
-
The dissimilarity characteristic of Husimi trees
-
F. Harary and R.Z. Norman, The dissimilarity characteristic of Husimi trees, Ann. of Math. 58 (1953), 134-141.
-
(1953)
Ann. of Math.
, vol.58
, pp. 134-141
-
-
Harary, F.1
Norman, R.Z.2
-
144
-
-
0002062526
-
On Steiner radius and Steiner diameter of a graph
-
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.
-
(1990)
Ars Combin.
, vol.29
, pp. 13-19
-
-
Henning, M.A.1
Oellermann, O.R.2
Swart, H.C.3
-
145
-
-
1542718746
-
On vertices with maximum Steiner eccentricity in graphs
-
(eds. Y. Alav, F. R. K. Chung, R. L. Graham, and D.F. Hsu), SIAM Publications
-
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.
-
(1991)
Graph Theory Combinatorics, Algorithms and Applications
, pp. 393-403
-
-
Henning, M.A.1
Oellermann, O.R.2
Swart, H.C.3
-
146
-
-
0043216039
-
An introduction to tolerance intersection graphs
-
(Y. Alavi, et ah, Eds.) Wiley Interscience
-
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.
-
(1991)
In Graph Theory, Combinatorics and Applications
, vol.2
, pp. 705-723
-
-
Jacobson, M.S.1
McMorris, F.R.2
Mulder, H.M.3
-
148
-
-
0010786237
-
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
-
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.
-
(1999)
Journal of Graph Theory
, vol.31
, pp. 75-94
-
-
Lai, Y.1
Williams, K.2
-
149
-
-
0043015771
-
A characterization of graphs of competition number m
-
J.R. Lundgren and J.S. Maybee, A characterization of graphs of competition number m, Discrete Appl. Math. 6 (1983), 319-322.
-
(1983)
Discrete Appl. Math.
, vol.6
, pp. 319-322
-
-
Lundgren, J.R.1
Maybee, J.S.2
-
150
-
-
0006629098
-
Sur deux propriétés des classes d'ensembles
-
E. Szpilrajn-Marczewski, Sur deux propriétés des classes d'ensembles, Fund. Math. 33 (1945), 303-307.
-
(1945)
Fund. Math.
, vol.33
, pp. 303-307
-
-
Szpilrajn-Marczewski, E.1
-
152
-
-
0042407078
-
Graph layouts, Applications of Discrete Mathematics
-
J.G. Michaels and K.H. Rosen (Editors), McGraw-Hill, New York
-
Z. Miller, Graph layouts, Applications of Discrete Mathematics, J. G. Michaels and K.H. Rosen (Editors), McGraw-Hill, New York (1991), 365-393.
-
(1991)
, pp. 365-393
-
-
Miller, Z.1
-
153
-
-
0003267425
-
Theory of graphs
-
O. Ore, Theory of graphs, Amer. Math. Soc. Transi. 38 (1962), 206-212.
-
(1962)
Amer. Math. Soc. Transi.
, vol.38
, pp. 206-212
-
-
Ore, O.1
-
154
-
-
0038621161
-
Representations of chordal graphs as subtrees of a tree
-
J.R. Walter, Representations of chordal graphs as subtrees of a tree, Journal of Graph Theory 2 (1978), 265-267.
-
(1978)
Journal of Graph Theory
, vol.2
, pp. 265-267
-
-
Walter, J.R.1
-
155
-
-
0003366395
-
-
Mehta Research Institute, Allahabad, MRI Lecture Notes in Math
-
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).
-
(1979)
Recent developments in the theory of domination in graphs
, pp. 1
-
-
Walikar, H.B.1
Acharya, B.D.2
Sampathkumar, E.3
-
156
-
-
0004200084
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
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.
-
(2004)
Extremal Graph Theory, §8.1 in Handbook of Graph Theory
-
-
Bollobas, B.1
Nikiforov, V.2
-
157
-
-
85128816789
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
R. Faudree, Ramsey Graph Theory, §8.3 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
-
(2004)
Ramsey Graph Theory, §8.3 in Handbook of Graph Theory
-
-
Faudree, R.1
-
159
-
-
0002885928
-
Combinatorial relations and chromatic graphs
-
R.E. Greenwood and A.M. Gleason, Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-7.
-
(1955)
Canad. J. Math
, vol.7
, pp. 1-7
-
-
Greenwood, R.E.1
Gleason, A.M.2
-
160
-
-
0001263144
-
On an extremal problem in graph theory (Hungarian)
-
P. Turan, On an extremal problem in graph theory (Hungarian), Mat. es Fiz. Lapok 48 (1941), 436-452.
-
(1941)
Mat. es Fiz. Lapok
, vol.48
, pp. 436-452
-
-
Turan, P.1
-
161
-
-
85128833835
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
N. Wormald, Random Graphs, §8.2 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
-
(2004)
Random Graphs, §8.2 in Handbook of Graph Theory
-
-
Wormald, N.1
-
164
-
-
77956058763
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
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.
-
(2004)
Applications to Timetabling, §5.6 in Handbook of Graph Theory
-
-
Burke, E.1
De Werra, D.2
Kingston, J.3
-
166
-
-
0040341902
-
Hamiltonian cycles in oriented graphs
-
R. Haggkvist, Hamiltonian cycles in oriented graphs, Combin. Probab. Comput. 2 (1993), 25-32.
-
(1993)
Combin. Probab. Comput.
, vol.2
, pp. 25-32
-
-
Haggkvist, R.1
-
167
-
-
51649206131
-
On dominance relations and the structure of animal societies. III. The condition for a score structure
-
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.
-
(1953)
Bull. Math. Biophys.
, vol.15
, pp. 143-148
-
-
Landau, H.G.1
-
168
-
-
85020048600
-
-
eds., J. L. Gross and J. Yellen, CRC Press
-
S.B. Maurer, Directed Acyclic Graphs, §3.2 in Handbook of Graph Theory, eds., J. L. Gross and J. Yellen, CRC Press, 2004.
-
(2004)
Directed Acyclic Graphs, §3.2 in Handbook of Graph Theory
-
-
Maurer, S.B.1
-
169
-
-
0040294305
-
Tournaments: scores, kings, generalizations and special topics
-
K.B. Reid, Tournaments: scores, kings, generalizations and special topics, Congressus Numer. 115 (1996), 171-211.
-
(1996)
Congressus Numer.
, vol.115
, pp. 171-211
-
-
Reid, K.B.1
-
171
-
-
0039659128
-
Edge-disjoint Hamiltonian paths and cycles in tournaments
-
C. Thomassen, Edge-disjoint Hamiltonian paths and cycles in tournaments, Proc. London Math. Soc. 45 (1982), 151-168.
-
(1982)
Proc. London Math. Soc.
, vol.45
, pp. 151-168
-
-
Thomassen, C.1
-
173
-
-
77956017019
-
Every regular tournament has two arc-disjoint Hamiltonian cycles
-
C.Q. Zhang, Every regular tournament has two arc-disjoint Hamiltonian cycles, J. Qufu Normal College, Special Issue Oper. Res. (1980), 70-81.
-
(1980)
J. Qufu Normal College, Special Issue Oper. Res
, pp. 70-81
-
-
Zhang, C.Q.1
-
174
-
-
0000927535
-
Paths, trees, and flowers
-
J. Edmonds, Paths, trees, and flowers, Canad. J. Math. 17 (1965), 449-467.
-
(1965)
Canad. J. Math.
, vol.17
, pp. 449-467
-
-
Edmonds, J.1
-
175
-
-
0015330635
-
Theoretical improvements in algorithmic efficiency for network flow problems
-
J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, JACM 19 (1972), 248-264.
-
(1972)
JACM
, vol.19
, pp. 248-264
-
-
Edmonds, J.1
Karp, R.M.2
-
178
-
-
34250966677
-
Uber Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre
-
D. König, Uber Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 (1916), 453-465.
-
(1916)
Math. Ann.
, vol.77
, pp. 453-465
-
-
König, D.1
-
180
-
-
0001550949
-
Die Theorie der regulären Graphen
-
J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193-220.
-
(1891)
Acta Math
, vol.15
, pp. 193-220
-
-
Petersen, J.1
-
185
-
-
51649146515
-
Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und Chemische Verbindungen
-
G. Polya, Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und Chemische Verbindungen, Acta Mathematica 68 (1937), 145-254.
-
(1937)
Acta Mathematica
, vol.68
, pp. 145-254
-
-
Polya, G.1
-
186
-
-
33750034428
-
Algebraic specification of interconnection networks by permutation voltage graph morphisms
-
J.L. Gross and J. Chen, Algebraic specification of interconnection networks by permutation voltage graph morphisms, Math. Systems Theory 29 (1996), 451-470.
-
(1996)
Math. Systems Theory
, vol.29
, pp. 451-470
-
-
Gross, J.L.1
Chen, J.2
-
187
-
-
0000391793
-
Generating all graph coverings by permutation voltage assignments
-
J.L. Gross and T.W. Tucker, Generating all graph coverings by permutation voltage assignments, Discrete Math. 18 (1977), 273-283.
-
(1977)
Discrete Math
, vol.18
, pp. 273-283
-
-
Gross, J.L.1
Tucker, T.W.2
-
189
-
-
0041617317
-
Components of branched coverings of current graphs
-
S.R. Alpert and J.L. Gross, Components of branched coverings of current graphs, J. Combin. Theory Ser. B 20 (1976), 283-303.
-
(1976)
J. Combin. Theory Ser. B
, vol.20
, pp. 283-303
-
-
Alpert, S.R.1
Gross, J.L.2
-
190
-
-
0009228279
-
The genus, regional number, and Betti number of a graph
-
R.A. Duke, The genus, regional number, and Betti number of a graph, Canad. J. Math. 18 (1966), 817-822.
-
(1966)
Canad. J. Math
, vol.18
, pp. 817-822
-
-
Duke, R.A.1
-
191
-
-
0040957721
-
A combinatorial representation for polyhedral surfaces
-
J. Edmonds, A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc. 7 (1960), A-646.
-
(1960)
Notices Amer. Math. Soc
, vol.7
, pp. A646
-
-
Edmonds, J.1
-
193
-
-
0024052891
-
Finding a maximum-genus graph imbedding
-
M. Furst, J. L. Gross, and L. McGeoch, Finding a maximum-genus graph imbedding, JACM 35 (1988), 523-534.
-
(1988)
JACM
, vol.35
, pp. 523-534
-
-
Furst, M.1
Gross, J.L.2
McGeoch, L.3
-
194
-
-
0001306999
-
Voltage graphs
-
J.L. Gross, Voltage graphs, Discrete Math. 9 (1974), 239-246.
-
(1974)
Discrete Math.
, vol.9
, pp. 239-246
-
-
Gross, J.L.1
-
195
-
-
84966252791
-
Branched coverings of graph imbeddings
-
J.L. Gross and S.R. Alpert, Branched coverings of graph imbeddings, Bull. Amer. Math. Soc. 79 (1973), 942-945.
-
(1973)
Bull. Amer. Math. Soc.
, vol.79
, pp. 942-945
-
-
Gross, J.L.1
Alpert, S.R.2
-
196
-
-
0038479790
-
The topological theory of current graphs
-
J.L. Gross and S.R. Alpert, The topological theory of current graphs, J. Combin. Theory Ser. B 17 (1974), 218-233.
-
(1974)
J. Combin. Theory Ser. B
, vol.17
, pp. 218-233
-
-
Gross, J.L.1
Alpert, S.R.2
-
197
-
-
0000391793
-
Generating all graph coverings by permutation voltage assignments
-
J.L. Gross and T.W. Tucker, Generating all graph coverings by permutation voltage assignments, Discrete Math. 18 (1977), 273-283.
-
(1977)
Discrete Math.
, vol.18
, pp. 273-283
-
-
Gross, J.L.1
Tucker, T.W.2
-
198
-
-
0004161410
-
-
Dover, (First Edition, Wiley-Interscience, 1987.)
-
J.L. Gross and T.W. Tucker, Topological Graph Theory, Dover, 2001. (First Edition, Wiley-Interscience, 1987.)
-
(2001)
Topological Graph Theory
-
-
Gross, J.L.1
Tucker, T.W.2
-
199
-
-
34447588722
-
Uber das Problem der Nachbargebiete
-
L. Heffter, Uber das Problem der Nachbargebiete, Math. Annalen 38 (1891), 477-580.
-
(1891)
Math. Annalen
, vol.38
, pp. 477-580
-
-
Heffter, L.1
-
200
-
-
35448972378
-
On the maximum genus of a graph
-
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.
-
(1971)
J. Combin. Theory Ser. B
, vol.11
, pp. 258-267
-
-
Nordhaus, E.A.1
Stewart, B.M.2
White, A.T.3
-
201
-
-
0039988711
-
A Kuratowski-type theorem for the maximum genus of a graph
-
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.
-
(1972)
J. Combin. Theory Ser. B
, vol.12
, pp. 260-267
-
-
Nordhaus, E.A.1
Ringeisen, R.D.2
Stewart, B.M.3
White, A.T.4
-
202
-
-
38249026284
-
The graph genus problem is NP-complete
-
C. Thomassen, The graph genus problem is NP-complete, J. of Algorithms 10 (1989), 568-576.
-
(1989)
J. of Algorithms
, vol.10
, pp. 568-576
-
-
Thomassen, C.1
-
203
-
-
85059770931
-
The complexity of theorem proving procedures
-
Proc. 3rd Annual ACM Symposium on Theory of Computing (STOC 71)
-
S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing (STOC 71) (1971), 151-158.
-
(1971)
, pp. 151-158
-
-
Cook, S.A.1
|