Graph Theory with Applications
暂无分享,去创建一个
[1] P. Erd Os,et al. On the maximal number of disjoint circuits of a graph , 2022, Publicationes Mathematicae Debrecen.
[2] Kenneth Appel,et al. The Four-Color Problem , 1978 .
[3] Robert L. Hemminger,et al. Graph reconstruction - a survey , 1977, J. Graph Theory.
[4] Béla Bollobás,et al. Extremal problems in graph theory , 1977, J. Graph Theory.
[5] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[6] J. Bondy. Diconnected Orientations and a Conjecture of Las Vergnas , 1976 .
[7] John Adrian Bondy,et al. A method in graph theory , 1976, Discret. Math..
[8] K. R. Parthasarathy,et al. The strong perfect-graph conjecture is true for K1, 3-free graphs , 1976, J. Comb. Theory, Ser. B.
[9] L. Lovász. Three short proofs in graph theory , 1975 .
[10] N.R. Malik,et al. Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.
[11] R. V. Randow. Introduction to the Theory of Matroids , 1975 .
[12] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .
[13] Jarmila Chvátalová,et al. Optimal labelling of a product of two paths , 1975, Discret. Math..
[14] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[15] Carsten Thomassen. Hypohamiltonian and hypotraceable graphs , 1974, Discret. Math..
[16] Chung C. Wang,et al. An Algorithm for the Chromatic Number of a Graph , 1974, JACM.
[17] A. Kelmans,et al. A certain polynomial of a graph and graphs with an extremal number of trees , 1974 .
[18] Jon Folkman. Notes on the Ramsey Number N(3, 3, 3, 3) , 1974, J. Comb. Theory, Ser. A.
[19] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[20] M. Albertson. Finding an independent set in a planar graph , 1974 .
[21] C. Thomassen. Some Homeomorphism Properties of Graphs , 1974 .
[22] L. Lovász,et al. Every directed graph has a semi-kernel , 1974 .
[23] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[24] R. M.. On Cubical Graphs , 1974 .
[25] D. R. Woodall. The binding number of a graph and its Anderson number , 1973 .
[26] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[27] Robert W. Irving. On a bound of Graham and Spencer for a graph-coloring constant , 1973 .
[28] Vasek Chvátal,et al. Tough graphs and hamiltonian circuits , 1973, Discret. Math..
[29] G. Wegner. A smallest graph of girth 5 and valency 5 , 1973 .
[30] M. Meyniel. Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe oriente , 1973 .
[31] Fan Chung Graham. On the ramsey numbers N(3, 3, ...3;2) , 1973, Discret. Math..
[32] L. Lovász. A note on the line reconstruction problem , 1972 .
[33] H. L. Abbott,et al. Lower Bounds for Some Ramsey Numbers , 1974, J. Comb. Theory, Ser. A.
[34] D. R. Woodall. Sufficient Conditions for Circuits in Graphs , 1972 .
[35] V. Chvátal. On Hamilton's ideals , 1972 .
[36] J. Bondy. Variations on the Hamiltonian Theme , 1972, Canadian Mathematical Bulletin.
[37] Shen Lin. On Ramsey numbers and Kr-coloring of graphs , 1972 .
[38] A. Owens. On the planarity of regular incidence sequences , 1971 .
[39] I. Anderson. Perfect matchings of a graph , 1971 .
[40] N. Vijayaditya. On Total Chromatic Number of a Graph , 1971 .
[41] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .
[42] H. Finck,et al. Einführung in die Theorie der endlichen Graphen , 1971 .
[43] G. Chartrand,et al. Introduction to the theory of graphs , 1971 .
[44] B. Grünbaum. A Problem in Graph Coloring , 1970 .
[45] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[46] W. T. Tutte. On chromatic polynomials and the golden ratio , 1970 .
[47] V. Chvátal. A note on coefficients of chromatic polynomials , 1970 .
[48] A. R. Rao,et al. An extremal problem in graph theory , 1968, Journal of the Australian Mathematical Society.
[49] J. Folkman. Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .
[50] D. de Werra,et al. On some combinatorial problems arising in scheduling , 1970 .
[51] R. Halin. A theorem on n-connected graphs , 1969 .
[52] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[53] L. Beineke,et al. A SEMINAR ON GRAPH THEORY , 1969 .
[54] J. G. Kalbfleisch,et al. On the maximal triangle-free edge-chromatic graphs in three colors , 1968 .
[55] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[56] L. Lovász. On chromatic number of finite set-systems , 1968 .
[57] J. Folkman. Regular line-symmetric graphs , 1967 .
[58] G. Dirac. On the structure of k-chromatic graphs , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.
[59] B. Roy. Nombre chromatique et plus longs chemins d'un graphe , 1967 .
[60] W. T. Tutte. Connectivity in graphs , 1966 .
[61] J. Moon. On Subtournaments of a Tournament , 1966, Canadian Mathematical Bulletin.
[62] K. B. Haley,et al. Programming, Games and Transportation Networks , 1966 .
[63] W. T. Tutte. On the algebraic theory of graph colorings , 1966 .
[64] B. Rothschild,et al. On Two Commodity Network Flows , 1966, Oper. Res..
[65] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .
[66] H. Abbott,et al. Sum-free sets of integers , 1966 .
[67] P. Erdös,et al. The Representation of a Graph by Set Intersections , 1966, Canadian Journal of Mathematics.
[68] W. T. Tutte. The Quest of the Perfect Square , 1965 .
[69] W. T. Tutte. Lectures on matroids , 1965 .
[70] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[71] K. Wagner. Beweis einer Abschwächung der Hadwiger-Vermutung , 1964 .
[72] G. Dirac. Homomorphism theorems for graphs , 1964 .
[73] O. Ore,et al. Graphs and Their Uses , 1964 .
[74] C. Tompkins. SPERNER'S LEMMA AND SOME EXTENSIONS, , 1963 .
[75] F. Harary. THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.
[76] C. Bouwkamp,et al. Tables relating to simple squared rectangles of orders nine through fifteen , 1961 .
[77] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[78] William T. Tutte,et al. A theory of 3-connected graphs , 1961 .
[79] P. Erdös. Graph Theory and Probability. II , 1961, Canadian Journal of Mathematics.
[80] Alan J. Hoffman,et al. On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..
[81] J. A. Hillier,et al. A Method for Finding the Shortest Route Through a Road Network , 1960 .
[82] W. T. Tutte. A Non-Hamiltonian Graph , 1960, Canadian Mathematical Bulletin.
[83] C. Nash-Williams. On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.
[84] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[85] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[86] D. Gale. A theorem on flows in networks , 1957 .
[87] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[88] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.
[89] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.
[90] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .
[91] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[92] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.
[93] M. Kendall. Further contributions to the theory of paired comparisons , 1955 .
[94] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.
[95] Jan Mycielski. Sur le coloriage des graphs , 1955 .
[96] G. Dirac,et al. A Theorem of Kuratowski , 1954 .
[97] G. Dirac. A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .
[98] G. Dirac. Map-Colour Theorems , 1952, Canadian Journal of Mathematics.
[99] G. Dirac. Some Theorems on Abstract Graphs , 1952 .
[100] Teh-Hsing Wei,et al. The algebraic foundations of ranking theory , 1952 .
[101] H. Coxeter. Self-dual configurations and regular graphs , 1950 .
[102] W. T. Tutte,et al. A Class of Self-Dual Maps , 1950, Canadian Journal of Mathematics.
[103] R. Frucht. Graphs of Degree Three with a Given Abstract Group , 1949, Canadian Journal of Mathematics.
[104] C. Shannon. A Theorem on Coloring the Lines of a Network , 1949 .
[105] P. J. Heawood. Map-Colour Theorem , 1949 .
[106] P. Erdös. Some remarks on the theory of graphs , 1947 .
[107] W. T. Tutte. The Factorization of Linear Graphs , 1947 .
[108] I. Good. Normal Recurring Decimals , 1946 .
[109] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .
[110] W. T. Tutte,et al. The Dissection of Rectangles Into Squares , 1940 .
[111] R. Sprague. Beispiel einer Zerlegung des Quadrats in lauter verschiedene Quadrate , 1939 .
[112] H. Robbins. A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .
[113] R. Frucht. Herstellung von Graphen mit vorgegebener abstrakter Gruppe , 1939 .
[114] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .
[115] P. Franklin. A Six Color Problem , 1934 .
[116] H. Whitney. Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.
[117] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .
[118] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[119] E. Sperner. Neuer beweis für die invarianz der dimensionszahl und des gebietes , 1928 .
[120] K. Menger. Zur allgemeinen Kurventheorie , 1927 .
[121] The Four-Color Problem , 1923 .
[122] G. Birkhoff. A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .
[123] J. Petersen. Die Theorie der regulären graphs , 1891 .
[124] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .