×

Graph theory (algorithmic, algebraic, and metric problems). (English) Zbl 0627.05043

Translation from Itogi Nauki Tekh., Ser. Teor. Veroyatn., Mat. Stat., Teor. Kibern. 23, 68-117 (Russian) (1985; Zbl 0606.05057).

MSC:

05C99 Graph theory
05-02 Research exposition (monographs, survey articles) pertaining to combinatorics

Citations:

Zbl 0606.05057
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] G. M. Adel’son-Vel’skií, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
[2] A. S. Asratyan and H. K. Khachatryan, ?Two theorems on Hamiltonian graphs,? Mat. Zametki,35, No. 1, 55?61 (1984). · Zbl 0552.05038
[3] O. V. Borodin, ?Proof of B. Grünbaum’s conjecture on acyclic 5-colorability of planar graphs,? Dokl. Akad. Nauk SSSR,231, No. 1, 18?20 (1976). · Zbl 0363.05031
[4] O. V. Borodin, ?Solution of the Ringel problem on vertex-face coloring of planar graphs and on the coloring of 1-planar graphs,? Sb. Trudov Inst. Mat. Sib. Otd. Akad. Nauk SSSR,41, 12?26 (1984). · Zbl 0565.05027
[5] V. G. Vizing, ?Coloring of graph vertices with predetermined colors,? Diskretnyi Analiz, No. 29, 3?10 (1976).
[6] M. Garey and D. Johnson, Computers and Intractability [in Russian], Mir, Moscow (1982). · Zbl 0522.68040
[7] G. A. Donets and N. Z. Shor, Algebraic Approach to the Problem of Coloring of Planar Graphs [in Russian], Naukova Dumka, Kiev (1982). · Zbl 0629.05033
[8] V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich, ?The problem of graph isomorphism,? J. Sov. Math.,29, No. 4 (1985). · Zbl 0564.05049
[9] A. A. Ivanov, ?A bound on the diameter of a distance-regular graph,? Dokl. Akad. Nauk SSSR,271, No. 4, 789?792 (1993).
[10] A. A. Ivanov, M. Kh. Klin, and I. A. Faradzhev, Primitive Representations of Non-Abelian Simple Groups of Order Less Than 106, Part 2, Preprint, VNII Sistemnykh Issledov., Moscow (1984).
[11] A. A. Ivanov and V. P. Shevchenko, ?On parallel computations on graphs,? Kibernetika, No. 3, 89?94 (1984). · Zbl 0557.68031
[12] A. O. Kats, ?Investigation of a system of distance vectors of a graph,? Latv. Mat. Ezhegodnik,20, 170?179 (1976).
[13] V. P. Kozyrev, ?Graph theory,? J. Sov. Math.,2, No. 5 (1974).
[14] V. P. Kozyrev, ?Finding all Hamiltonian chains of a graph and studying Hamilton-connected graphs,? Zh. Vychisl. Mat. Mat. Fiz.,16, No. 3, 767?774 (1976).
[15] G. N. Kopylov and E. A. Timofeev, ?On centers and radii of graphs,? Usp. Mat. Nauk,32, No. 6, 226 (1977).
[16] N. M. Kornienko, ?On Hamiltonian completion of some classes of graphs,? Vestsi Akad. Navuk BSSR,Ser. Fiz.-Mat. Navuk, No. 4, 18?22 (1982). · Zbl 0503.05035
[17] A. D. Korshunov, ?Solution of P. Erdös and A. Rényi problem on Hamiltonian cycles in undirected graphs,? Dokl. Akad. Nauk SSSR,228, No. 3, 529?532 (1976).
[18] A. D. Korshunov, ?On the number of pairs of Hamiltonian cycles in a complete graph which have a given number of common edges,? Upravlyaemye Sistemy,13, 40?57 (1984).
[19] A. V. Kostochka, ?Upper estimates of the chromatic number of a graph in terms of its degree, density, and girth,? Dokl. Akad. Nauk SSSR,235, No. 3, 516?518 (1977).
[20] A. V. Kostochka, ?An analogue of the Shannon estimate for total colorings,? Sb. Trudov Inst. Mat. Sib. Otd. Akad. Nauk SSSR,30, 13?22 (1977). · Zbl 0424.05026
[21] A. V. Kostochka, ?Degree, density, and chromatic number of graphs,? Sb. Trudov Inst. Mat. Sib. Otd. Akad. Nauk SSSR,35, 45?70 (1980). · Zbl 0459.05038
[22] A. V. Kostochka, ?An exact upper estimate of a total chromatic number of multigraphs? [in Russian], 24 Int. Wiss. Kolloq., Ilmenan, 22 Okt.?26 Okt. 1979, Heft 5. Vortragsreihe B2, B3. Ilmenau, s.a., pp. 33?36.
[23] A. M. Kochkarov, ?Multicriteria problem of graph covering by chains of a prescribed length,? in: Mathematical Problems of Operations Research [in Russian], Minsk (1982), pp. 42?49.
[24] A. M. Kochkarov, ?An asymptotic approach to a multicriteria problem of covering a graph with chains,? Dokl. Akad. Nauk BSSR,27, No. 10, 911?913 (1983). · Zbl 0521.05052
[25] Yu. V. Matiyasevich, ?One criterion for colorability of graph vertices formulated in terms of edge orientation,? Diskretnyi Analiz, No. 26, 65?71 (1974).
[26] Methods and Programs for Solving Optimization Problems on Graphs and Networks [in Russian], Parts 1 and 2, Computing Center, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk (1984).
[27] V. L. Mironov, ?Reconstructability of graphs having at most two cycles,? in: Optimization Methods and Applications [in Russian], Irkutsk (1979), pp. 140?149.
[28] V. B. Mnukhin, ?Some sufficient conditions of edge reconstruction of a graph,? in: [26], Part 2, pp. 88?89.
[29] N. N. Mozhan, ?Chromatic number of graphs with density not exceeding two-thirds of the maximal degree,? Sb. Trudov Inst. Mat. Sib. Otd. Akad, Nauk SSSR,39, 52?65 (1983). · Zbl 0536.05023
[30] Zh. G. Nikogosyan, ?A sufficient condition for Hamiltonian property of a graph,? Dokl. Akad. Nauk ArmSSR,78, No. 1, 12?16 (1984). · Zbl 0545.05045
[31] V. A. Nosov, V. N. Sachkov, and V. E. Tarakanov, ?Combinatorial analysis (nonnegative matrices, algorithmic problems),? J. Sov. Math.,29, No. 1 (1985). · Zbl 0568.05013
[32] V. A. Perepelitsa, ?On a class of multicriteria problems on graphs and hypergraphs,? Kibernetika, No. 4, 62?67 (1984). · Zbl 0567.90072
[33] A. I. Petrenko, A. Ya. Tetel’baum, and B. L. Shramchenko, Automatization of the Construction of Electronic Equipment [in Russian], Vishcha Shkola, Kiev (1980).
[34] I. N. Ponomarenko, ?A polynomial algorithm of isomorphism for graphs not contractible on K3, g,? J. Sov. Math.,34, No. 4 (1986).
[35] V. K. Popkov, C. B. Kaul’, M. I. Nechepurenko, E. M. Bukreev, and A. I. Kalenikov, Methods of Structure Optimization for Zone Communication Networks, Computing Center of the Siberian Division of the USSR Academy of Sciences, Novosibirsk (1984).
[36] Collection of Works of the All-Union Sci.-Research Institute of System Analysis [in Russian], No. 3, Moscow (1979).
[37] A. I. Serdyukov, ?On a problem of finding a Hamiltonian cycle (circuit) in the presence of prohibitions,? Upravlyaemye Sistemy,19, 57?64 (1979). · Zbl 0475.05056
[38] V. P. Soltan, ?d-convex sets in finite metric spaces,? Izv. Akad. Nauk Moldav. SSR, Ser. Fiz.-Tekh. Mat. Nauk, No. 2, 29?33 (1978).
[39] V. P. Soltan, ?d-convexity in graphs,? Dokl. Akad Nauk SSSR,272, No. 3, 535?537 (1983).
[40] V. P. Soltan, Introduction to Axiomatic Theory of Convexity [in Russian], Shtiintsa, Kishinev (1984). · Zbl 0559.52001
[41] V. P. Soltan and V. D. Chepoi, ?Certain classes of d-convex functions in graphs,? Dokl. Akad. Nauk SSSR,273, No. 6, 1314?1317 (1983).
[42] V. P. Soltan and V. D. Chepoi, ?Conditions for the preservation by d-convexity in a graph of set diameters,? Kibernetika, No. 6, 14?18 (1983).
[43] V. P. Soltan and V. D. Chepoi, ?d-convex sets in triangulated graphs,? Mat. Issled., No. 78, 105?124 (1984).
[44] V. P. Soltan and V. D. Chepoi, ?The number of d-convex sets in a graph,? Izv. Akad. Nauk Moldav. SSR, Ser. Fiz.-Tekh. Mat. Nauk, No. 2, 19?23 (1984).
[45] P. S. Soltan, Extremal Problems on Convex Sets [in Russian], Shtiintsa, Kishinev (1976). · Zbl 0422.52001
[46] V. A. Tashkinov, ?3-homogeneous parts of 4-homogeneous graphs,? Mat. Zametki,36, No. 2, 239?259 (1984).
[47] J. Fiamcik, ?Acyclic chromatic class of a graph,? Math. Slovaca,28, No. 2, 139?145 (1978). · Zbl 0388.05015
[48] F. Harary, Graph Theory [Russian translation], Mir, Moscow (1973).
[49] L. G. Khachiyan, ?A polynomial algorithm in linear programming,? Dokl. Akad. Nauk SSSR,244, No. 5, 1093?1096 (1979). · Zbl 0414.90086
[50] N. P. Khomenko and N. V. Lysenko, ?Necessary and sufficient conditions for n-colorability of graphs,? in: Graph Theory [in Russian], Kiev (1977), pp. 107?114.
[51] D. Tsvetkovich, M. Dub, and H. Sachs, Graph Spectra. Theory and Application [in Russian] Naukova Dumka, Kiev (1984).
[52] S. V. Yushmanov, ?On one method of specifying graphs,? Voprosy Kibernet. (Moscow), No. 64, 97?111 (1980).
[53] S. V. Yushmanov, ?Reconstruction of an arbitrary graph from a certain subset of rows and columns of its distance matrix,? Dokl. Akad. Nauk SSSR,259, No. 1, 49?51 (1981). · Zbl 0485.05047
[54] S. V. Yushmanov, ?Covering of a graph by a system of shortest simple chains,? Dokl. Akad. Nauk SSSR,266, No. 6, 1303?1305 (1982). · Zbl 0512.05038
[55] S. V. Yushmanov, ?Specification of a tree with p pendant vertices by 2p-3 elements of its distance matrix,? Mat. Zametki,35, No. 6, 877?887 (1984). · Zbl 0561.05041
[56] N. Achuthan, ?On the n-clique chromatic number of complementary graphs,? Combinatorics-’79, Part 2, Amsterdam e. a. (1980), pp. 285?290. · Zbl 0462.05032
[57] J. Akiyama, G. Exoo, and F. Harary, ?Covering and packing in graphs III. Cyclic and acyclic invariants,? Math. Slovaca,30, No. 4, 405?417 (1980). · Zbl 0458.05050
[58] J. Akiyama, G. Exoo, and F. Harary, ?Covering and packing in graphs IV: Linear arboricity,? Networks,11, No. 1, 69?72 (1981). · Zbl 0479.05027 · doi:10.1002/net.3230110108
[59] J. Akiyama and Takashi Hamada, ?The decompositions of line graphs, middle graphs, and total graphs of complete graphs into forests,? Discrete Math.,26, No. 3, 203?208 (1979). · Zbl 0421.05056 · doi:10.1016/0012-365X(79)90024-4
[60] M. O. Albertson and D. M. Berman, ?An acyclic analogue to Heawood’s theorem,? Glasgow Math.,19, No. 2, 163?166 (1978). · Zbl 0378.05030 · doi:10.1017/S001708950000358X
[61] F. Allaire, ?Another proof of the four color theorem,? Congr. Numer.,20, 3?72 (1978). · Zbl 0506.05028
[62] D. Angluin and L. G. Valiant, ?Fast probabilistic algorithms for Hamiltonian circuits and matchings,? J. Comput. System Sci.,18, No. 2, 155?197 (1979). · Zbl 0437.05040 · doi:10.1016/0022-0000(79)90045-X
[63] K. Appel and W. Haken, ?Every planar map is four colorable,? Bull. Am. Math. Soc.,82, No. 5, 711?712 (1976). · Zbl 0331.05106 · doi:10.1090/S0002-9904-1976-14122-5
[64] K. Appel and W. Haken, ?A proof of the four color theorem,? Discrete Math.,16, No. 2, 179?180 (1976). · Zbl 0339.05109 · doi:10.1016/0012-365X(76)90147-3
[65] K. Appel and W. Haken, ?Every planar map is four colorable. Part I. Discharging,? Illinois J. Math.,21, No. 3, 429?490 (1977). · Zbl 0387.05009
[66] K. Appel, W. Haken, and J. Koch, ?Every planar map is four colorable. Part II. Reducibility,? Illinois J. Math.,21, No. 3, 491?567 (1977). · Zbl 0387.05010
[67] J. C. Arditti and D. de Werra, ?A note on a paper: ?On a property of the class of n-colorable graphs? by D. Seinsche,? J. Combin. Theory, Ser. B,21, No. 1, 90 (1976). · Zbl 0297.05108 · doi:10.1016/0095-8956(76)90033-2
[68] E. Arjomandi, ?An efficient algorithm for coloring the edges of a graph with ? + 1 colors,? INFOR. Can. J. Oper. Res. Inf. Process.,20, No. 2?3, 82?101 (1982). · Zbl 0521.05030
[69] Takao Asano and Tomio Hirata, ?Edge-contraction problems,? J. Comput. System Sci.,26, No. 2, 197?208 (1983). · Zbl 0539.68034 · doi:10.1016/0022-0000(83)90012-0
[70] Takao Asano, Shunji Kikuchi, and Nobuki Saito, ?A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs,? Discrete Appl. Math.,7, No. 1, 1?15 (1984). · Zbl 0531.68008 · doi:10.1016/0166-218X(84)90109-4
[71] L. Babai, ?On the complexity of canonical labeling of strongly regular graphs,? SIAM J. Comput.,9, No. 1, 212?216 (1980). · Zbl 0446.68052 · doi:10.1137/0209018
[72] L. Babai, ?Moderately exponential bound for graph isomorphism,? Lecture Notes Comput. Sci.,117, 54?50 (1981). · Zbl 0462.68040
[73] L. Babai, P. Erdös and S. M. Selkow, ?Random graph isomorphism,? SIAM J. Comput.,9, No. 3, 628?635 (1980). · Zbl 0454.05038 · doi:10.1137/0209047
[74] L. Babai and L. Ku?era, ?Canonical labelling of graphs in linear average time,? 20th Annu. Symp. Found. Comput. Sci., San Juan, 1979. New York, N.Y. (19-79), pp. 39?46.
[75] H. J. Bandelt and J. P. Barthélemy, ?Medians in median graphs,? Discrete Appl. Math.,8, No. 2, 131?142 (1984). · Zbl 0536.05057 · doi:10.1016/0166-218X(84)90096-9
[76] L. M. Batten, ?Geodesic subgraphs,? J. Graph Theory,7, No. 2, 159?163 (1983). · Zbl 0516.05050 · doi:10.1002/jgt.3190070203
[77] G. Berge, Graphs and Hypergraphs, 2nd rev. ed., North-Holland, Amsterdam-London; Elsevier, New York (1976) (Vol. XIV). · Zbl 0311.05101
[78] D. M. Berman, ?A note on choosability in planar graphs,? Comment. Math. Univ. Carolin.,23, No. 3, 537?540 (1982). · Zbl 0505.05029
[79] J. C. Bermond, C. Huang, A. Rosa, and D. Sotteau, ?Decomposition of complete graphs into isomorphic subgraphs with five vertices,? Ars. Combin.,10, 211?254 (1980). · Zbl 0454.05053
[80] J. C. Bermond, B. Jackson, and F. Jaeger, ?Shortest converings of graphs with cycles,? J. Combin. Theory, Ser. B,35, No. 3, 297?308 (1983). · Zbl 0559.05037 · doi:10.1016/0095-8956(83)90056-4
[81] N. L. Biggs, Algebraic Graph Theory, Cambridge Univ. Press (1974) (VII). · Zbl 0284.05101
[82] N. L. Biggs, ?Automorphic graphs and the Krein condition,? Geom. Dedicata,5, No. 1, 117?127 (1976). · Zbl 0333.05108 · doi:10.1007/BF00148146
[83] G. S. Bloom, J. W. Kennedy, and L. V. Quintas, ?Some problems concerning distance and path degree sequences,? Lect. Notes Math.,1018, 179?190 (1983). · Zbl 0538.05057 · doi:10.1007/BFb0071628
[84] F. T. Boesch, S. Chen, and J. A. M. McHugh, ?On covering the points of a graph with point disjoint paths,? Lect. Notes Math.,406, 201?212 (1974). · Zbl 0298.05133 · doi:10.1007/BFb0066442
[85] B. Bollobás, ?Almost all regular graphs are Hamiltonian,? European J. Cpmbin.,4, No. 2, 97?106 (1983). · Zbl 0513.05048 · doi:10.1016/S0195-6698(83)80039-0
[86] B. Bollobás and A. Thomason, ?Set colorings of graphs,? Discrete Math.,25, No. 1, 21?26 (1979). · Zbl 0403.05038 · doi:10.1016/0012-365X(79)90148-1
[87] J. A. Bondy, ?A remark of two sufficient conditions for Hamilton cycles,? Discrete Math.,22, No. 2, 191?193 (1978). · Zbl 0381.05040 · doi:10.1016/0012-365X(78)90124-3
[88] J. A. Bondy and V. Chvátal, ?A method in graph theory,? Discrete Math.,15, No. 2, 111?135 (1976). · Zbl 0331.05138 · doi:10.1016/0012-365X(76)90078-9
[89] J. A. Bondy and R. L. Hemminger, ?Graph reconstruction. A survey,? J. Graph Theory,1, No. 3, 227?268 (1977). · Zbl 0375.05040 · doi:10.1002/jgt.3190010306
[90] O. V. Borodin, ?On acyclic colorings of planar graphs,? Discrete Math.,25, No. 3, 211?236 (1977). · Zbl 0406.05031 · doi:10.1016/0012-365X(79)90077-3
[91] O. V. Borodin and A. V. Kostochka, ?On an upper bound of a graph’s chromatic number depending on the graph’s degree and density,? J. Combin. Theory, Ser. B,23, No. 2?3, 247?250 (1977). · Zbl 0336.05104 · doi:10.1016/0095-8956(77)90037-5
[92] R. C. Brigham and R. D. Dutton, ?Generalized k-tuple colorings of cycles and other graphs,? J. Combin. Theory, Ser. B,32, No. 1, 90?94 (1982). · Zbl 0465.05032 · doi:10.1016/0095-8956(82)90079-X
[93] F. Buckley, ?The central ratio of a graph,? Discrete Math.,38, No. 1, 17?21 (1982). · Zbl 0469.05057 · doi:10.1016/0012-365X(82)90164-9
[94] F. Buckley, ?Equalities involving certain graphical distributions,? Lect. Notes Math.,1073, 179?192 (1984). · Zbl 0549.05045 · doi:10.1007/BFb0073116
[95] P. A. Catlin, ?A bound on the chromatic number of a graph,? Discrete Math.,22, No. 1, 81?83 (1978). · Zbl 0374.05023 · doi:10.1016/0012-365X(78)90049-3
[96] P. A. Catlin, ?Another bound on the chromatic number of a graph,? Discrete Math.,24, No. 1, 1?6 (1978). · Zbl 0384.05043 · doi:10.1016/0012-365X(78)90167-X
[97] G. Chartrand, A. M. Hobbs, H. A. Jung, S. F. Kapoor, C. St. J. A. Nash-Williams, ?The square of a block is Hamiltonian connected,? J. Combin. Theory, Ser. B,16, No. 3, 290?292 (1974). · Zbl 0277.05129 · doi:10.1016/0095-8956(74)90075-6
[98] G. Chartrand, L. Lesniak-Foster, and C. E. Wall, ?Homogeneously n-traceable graphs,? Ars. Combin.,12, 311?317 (1981). · Zbl 0476.05058
[99] N. Chiba, T. Nishizeki, and N. Saito, ?A linear algorithm for five-coloring a planar graph,? Lect. Notes Comput. Sci.,108, 9?19 (1981). · Zbl 0465.68034 · doi:10.1007/3-540-10704-5_2
[100] N. Chiba, T. Nishizeki, and N. Saito, ?An algorithm for finding a large independent set in planar graphs,? Networks,13, No. 2, 247?252 (1983). · Zbl 0507.68040 · doi:10.1002/net.3230130209
[101] S. Choudum, ?Chromatic bounds for a class of graphs,? Q. J. Math.,28, No. 11, 257?270 (1977). · Zbl 0364.05023 · doi:10.1093/qmath/28.3.257
[102] F. R. K. Chung, ?On partitions of graphs into trees,? Discrete Math.,23, No. 1, 23?30 (1978). · Zbl 0389.05029 · doi:10.1016/0012-365X(78)90183-8
[103] F. R. K. Chung, ?On the coverings of graphs,? Discrete Math.,30, No. 2, 89?93 (1980). · Zbl 0451.05037 · doi:10.1016/0012-365X(80)90109-0
[104] F. R. K. Chung and R. L. Graham, ?Recent results in graph decompositions,? London Math. Soc. Lect. Note Ser., No. 52, 103?123 (1981). · Zbl 0464.05046
[105] V. Chvátal, ?Determining the stability number of a graph,? SIAM J. Comput.,6, No. 4, 643?662 (1977). · Zbl 0395.05047 · doi:10.1137/0206046
[106] V. Chvátal, ?Recognizing decomposable graph,? J. Graph Theory,8, No. 1, 51?53 (1984). · Zbl 0536.05030 · doi:10.1002/jgt.3190080106
[107] F. H. Clarke, ?A graph polynomial and its applications,? Discrete Math.,3, No. 4, 305?313 (1972). · Zbl 0244.05111 · doi:10.1016/0012-365X(72)90088-X
[108] F. H. Clarke and R. E. Jamison, ?Multicolorings, measures, and games on graphs,? Discrete Math.,14, No. 3, 241?245 (1976). · Zbl 0328.05110 · doi:10.1016/0012-365X(76)90036-4
[109] A. M. Cohen, ?Synopsis of known distance-regular graphs with large diameters,? Math. Cent. Afd. Zuivere Wisk., No. 168 (1981).
[110] T. F. Coleman and J. J. Moré, ?Estimation of sparse Hessian matrix and graph coloring problems,? Math. Programming,28, No. 3, 243?270 (1984). · Zbl 0572.65029 · doi:10.1007/BF02612334
[111] J. B. Collier and E. F. Schmeichel, ?New flipflop constructions for hypohamiltonian graphs,? Discrete Math.,18, No. 3, 265?271 (1977). · Zbl 0367.05046 · doi:10.1016/0012-365X(77)90130-3
[112] R. J. Cook, ?Complementary graphs and total chromatic numbers,? SIAM J. Appl. Math.,27, No. 4, 626?628 (1974). · Zbl 0295.05102 · doi:10.1137/0127052
[113] R. J. Cook, ?Chromatic number and girth,? Period. Math. Hungar.,6, No. 1, 103?107 (1975). · Zbl 0313.05107 · doi:10.1007/BF02018401
[114] R. J. Cook, ?Point partition numbers and girth,? Proc. Am. Math. Soc.,49, No. 2, 510?514 (1975). · doi:10.1090/S0002-9939-1975-0371734-8
[115] R. J. Cook, ?Some results in topological graph theory II,? in: Probl. Comb. et Theór. Graphes, Colloq., Orsay, 1976. Paris (1978), pp. 85?87.
[116] R. J. Cook and D. G. Pryce, ?A class of geodetic blocks,? J. Graph Theory,6, No. 2, 157?168 (1982). · Zbl 0499.05037 · doi:10.1002/jgt.3190060210
[117] R. M. Damerell, ?Distance-transitive and distance-regular digraphs,? J. Combin. Theory, Ser. B,31, No. 1, 46?53 (1981). · Zbl 0468.05034 · doi:10.1016/S0095-8956(81)80009-3
[118] J. M. Delire, ?Graphs with high Radon number,? Bull. Cl. Sci. Acad. R. Belg.,70, No. 1, 14?24 (1984).
[119] R. W. Deming, ?Acyclic orientations of a graph and chromatic and independence numbers,? J. Combin. Theory, Ser. B,26, No. 1, 101?110 (1979). · Zbl 0331.05110 · doi:10.1016/0095-8956(79)90048-0
[120] Narsingh Deo and Chi-yin Pang, ?Shortest-path algorithms: texonomy and annotation,? Networks,14, No. 2, 275?329 (1984). · Zbl 0542.90101 · doi:10.1002/net.3230140208
[121] A. Donald, ?An upper bound for the path number of a graph,? J. Graph Theory,4, No. 2, 189?201 (1980). · Zbl 0403.05056 · doi:10.1002/jgt.3190040207
[122] R. J. Douglas, ?Tournaments that admit exactly one Hamiltonian circuit,? Proc. London Math. Soc.,21, No. 4, 716?730 (1970). · Zbl 0207.23004 · doi:10.1112/plms/s3-21.4.716
[123] J. K. Doyle and J. E. Graver, ?Mean distance in a graph,? Discrete Math.,17, No. 2, 147?155 (1977). · Zbl 0361.05045 · doi:10.1016/0012-365X(77)90144-3
[124] P. Duchet and H. Meyniel, ?Ensemble convexes dans les graphes. I. Théorèmes de Helly et de Radon pour graphes et surfaces,? European J. Combin.,4, No. 2, 127?132 (1983). · Zbl 0523.05031 · doi:10.1016/S0195-6698(83)80041-9
[125] M. Edelberg, M. R. Garey, and R. L. Graham, ?On the distance matrix of a tree,? Discrete Math.,14, No. 1, 23?39 (1976). · Zbl 0328.05103 · doi:10.1016/0012-365X(76)90003-0
[126] M. N. Ellingham and J. D. Horton, ?Non-Hamiltonian 3-connected cubic bipartite graphs,? J. Combin. Theory, Ser. B,34, No. 3, 350?353 (1983). · Zbl 0516.05033 · doi:10.1016/0095-8956(83)90046-1
[127] H. Enomoto and B. Péroche, ?The linear arboricity of some regular graphs,? J. Graph Theory,8, No. 2, 309?324 (1984). · Zbl 0581.05017 · doi:10.1002/jgt.3190080211
[128] R. C. Entringer, D. E. Jackson, and D. A. Snyder, ?Distance in graphs,? Czechoslovak Math. J.,26, No. 2, 283?296 (1976). · Zbl 0329.05112
[129] P. Erdös and R. J. Wilson, ?On the chromatic index of almost all graphs,? J. Combin. Theory, Ser. B,23, No. 2?3, 255?257 (1977). · Zbl 0378.05032 · doi:10.1016/0095-8956(77)90039-9
[130] A. H. Esfahanian and S. L. Hakimi, ?On computing the connectivities of graphs and digraphs,? Networks,14, No. 2, 355?366 (1984). · Zbl 0542.68051 · doi:10.1002/net.3230140211
[131] A. Farley, S. Hedetniemi, and A. Proskurowski, ?Partitioning trees: matching, domination, and maximum diameter,? Internat. J. Comput. Inform. Sci.,10, No. 1, 55?61 (1981). · Zbl 0464.68068 · doi:10.1007/BF00978378
[132] R. J. Faudree, C. C. Rousseau, and R. H. Shelp, ?Theory of path length distributions, I,? Discrete Math.,6, No. 1, 35?52 (1973). · Zbl 0263.05115 · doi:10.1016/0012-365X(73)90035-6
[133] T. I. Fenner and A. M. Frieze, ?On the existence of Hamiltonian cycles in a class of random graphs,? Discrete Math.,45, No. 2?3, 301?305 (1983). · Zbl 0511.05053 · doi:10.1016/0012-365X(83)90046-8
[134] J. Fiam?ik, ?Acyclic chromatic index of subdivided graph,? Arch. Math.,20, No. 2, 69?82 (1984).
[135] I. S. Filotti and J. N. Mayer, ?A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus,? Proc. 12th Annu. ACM Symp. Graph Theory Comput., 236?23 (1980).
[136] I. S. Filotti, G. Miller, and J. Reif, ?On determining the genus of a graph in vO(g) steps,? Proc. 11th Annu. ACM Symp. Graph Theory Comput., 27?37 (1979).
[137] S. Fiorini, ?On the chromatic index of outerplanar graphs,? J. Combin. Theory, Ser. B,18, No. 1, 35?38 (1975). · Zbl 0273.05107 · doi:10.1016/0095-8956(75)90060-X
[138] S. Fiorini and J. Lauri, ?Edge-reconstruction of 4-connected planar graphs,? J. Graph Theory,6, No. 1, 33?42 (1982). · Zbl 0449.05046 · doi:10.1002/jgt.3190060105
[139] S. Fiorini and J. Lauri, ?On the edge-reconstruction of graphs which triangulate surfaces,? Q. J. Math.,33, No. 130, 191?214 (1982). · Zbl 0452.05047 · doi:10.1093/qmath/33.2.191
[140] H. Fleischner, ?The reconstruction of line-critical blocks.? Ars. Combin.,7, 223?254 (1979). · Zbl 0422.05054
[141] M. F. Foregger, T. H. Foregger, and M. Hill, ?The tree-covering numbex of a graph,? Czechoslovak Math. J.,30, No. 4, 633?639 (1980). · Zbl 0473.05048
[142] J. L. Fouquet and J. L. Jolivet, ?Hypohamiltonian oriented graphs,? Cahiers Centre Études Rech. Opér.,20, No. 2, 171?181 (1978).
[143] A. Gardiner, ?When is an array realized by a distance-regular graph?? in: Algebraic Methods in Graph Theory, Vol. 1, Amsterdam, Budapest (1981), pp. 209?219.
[144] M. R. Garey and D. S. Johnson, ?The rectilinear Steiner tree problem is NP-cmplete,? SIAM J. Appl. Math.,32, No. 4, 826?834 (1977). · Zbl 0396.05009 · doi:10.1137/0132071
[145] M. R. Garey and D. S. Johnson, ?The complexity of near-optimal graph coloring,? J. Assoc. Comput. Math.,23, No. 1, 43?49 (1976). · Zbl 0322.05111 · doi:10.1145/321921.321926
[146] M. R. Garey, D. S. Johnson, and L. Stockmeyer, ?Some simplified NP-complete graph problems,? Theor. Comput. Sci.,1, No. 3, 237?267 (1976). · Zbl 0338.05120 · doi:10.1016/0304-3975(76)90059-1
[147] M. R. Garey, D. S. Johnson, and R. E. Tarjan, ?The planar Hamiltonian circuit problem is NP-complete,? SIAM J. Comput.,5, No. 4, 704?714 (1976). · Zbl 0346.05110 · doi:10.1137/0205049
[148] D. P. Geller, ?r-tuple colorings of uniquely colorable graphs,? Discrete Math.,16, No. 1, 9?12 (1976). · Zbl 0338.05104 · doi:10.1016/0012-365X(76)90089-3
[149] D. P. Geller and S. Stahl, ?The chromatic number and other functions of lexicographic product,? J. Combin. Theory, Ser. B,19, No. 1, 87?95 (1975). · Zbl 0282.05114 · doi:10.1016/0095-8956(75)90076-3
[150] W. B. Giles, ?The reconstruction of outerplanar graphs,? J. Combin. Theory, Ser. B,16, No. 3, 215?226 (1974). · Zbl 0274.05102 · doi:10.1016/0095-8956(74)90066-5
[151] W. B. Giles, ?Point deletions of outerplanar blocks,? J. Combin. Theory, Ser. B,20, No. 2, 103?116 (1976). · Zbl 0349.05105 · doi:10.1016/0095-8956(76)90001-0
[152] W. B. Giles, ?Reconstructing trees from two point delected subtrees,? Discrete Math.,15, No. 4, 325?332 (1976). · Zbl 0336.05102 · doi:10.1016/0012-365X(76)90046-7
[153] M. Gionfriddo, ?Sulle colorazioni Ls d’un grafo finite,? Boll. Un. Mat. Ital. A,15, No. 2, 444?454 (1978). · Zbl 0411.05036
[154] M. Gionfriddo, ?Automorfismi colorati e colorazioniG in un grafo,? Boll. Un. Mat. Ital. B,17, No. 3, 1338?1349 (1980). · Zbl 0481.05029
[155] M. Gionfriddo, ?Alcuni risultati relativi alle colorazioni Ls d’un grafo,? Riv. Mat. Univ. Parma,6, 125?133. · Zbl 0466.05032
[156] M. Gionfriddo, ?Su un problema relative alle colorazioni L2 d’un grafo planare e colorazioni Ls,? Riv. Mat. Univ. Parma,6, 151?160 (1980). · Zbl 0466.05033
[157] C. D. Godsil and B. D. McKay, ?Feasibility conditions for the existence of walk-regular graphs,? Linear Algebra Appl.,30, 51?61 (1980). · Zbl 0452.05045 · doi:10.1016/0024-3795(80)90180-9
[158] C. D. Godsil and B. D. McKay, ?Spectral conditions for reconstructibility of a graph,? J. Combin. Theory, Ser. B,30, No. 3, 285?289 (1981). · Zbl 0394.05035 · doi:10.1016/0095-8956(81)90046-0
[159] S. Goodman and S. Hedetniemi, ?On the Hamiltonian completion problem,? Lect. Notes Math.,406, 262?272 (1974). · Zbl 0297.05134 · doi:10.1007/BFb0066448
[160] S. Goodman and S. Hedetniemi, ?On Hamiltonian walks in graphs,? SIAM J. Comput.,3, No. 3, 214?221 (1974). · Zbl 0269.05113 · doi:10.1137/0203017
[161] S. Goodman and S. Hedetniemi, ?Sufficient conditions for a graph to be Hamiltonian,? J. Combin. Theory, Ser. B,16, No. 2, 175?180 (1974). · Zbl 0275.05126 · doi:10.1016/0095-8956(74)90061-6
[162] R. J. Gould, ?Degree sets for homogeneously traceable nonhamiltonian graphs,? Colloq. Math.,45, No. 1, 155?158 (1981 (1982)). · Zbl 0492.05046
[163] R. J. Gould and M. S. Jacobson, ?Forbidden subgraphs and Hamiltonian properties of graphs,? Discrete Math.,42, No. 2?3, 189?196 (1982). · Zbl 0495.05039 · doi:10.1016/0012-365X(82)90216-3
[164] R. L. Graham and L. Lovász, ?Distance matrix polynomials of trees,? Adv. Math.,29, No. 1, 60?88 (1978). · Zbl 0382.05023 · doi:10.1016/0001-8708(78)90005-1
[165] R. L. Graham and L. Lovász, ?Distance matrix polynomials of trees,? Probl. Comb. et Théor. Graphes, Colloq., Orsay, 1976, Paris (1978), pp. 189?190.
[166] D. L. Greenwell, ?Reconstructuring graphs,? Proc. Am. Math. Soc.,30, No. 3, 431?433 (1971). · doi:10.1090/S0002-9939-1971-0286699-3
[167] H. D. O. F. Gronau, ?Coverings of complete (di-)graph with n vertices by complete bipartite (di)graphswith n vertices. I,? Discrete Math.,37, No. 1, 67?72 (1981). · Zbl 0464.05050 · doi:10.1016/0012-365X(81)90140-0
[168] M. Grötschel and G. L. Nemhauser, ?A polynomial algorithm for the max-cut problem on graphs without long odd cycles,? Math. Programming,29, No. 1, 28?40 (1984). · Zbl 0532.90074 · doi:10.1007/BF02591727
[169] S. K. Gupta, ?Reconstruction conjecture for square of a tree,? Lect. Notes Math.,1073, 268?278 (1984). · doi:10.1007/BFb0073126
[170] R. Häggkvist and C. Thomassen, ?On pancyclic digraphs,? J. Combin. Theory, Ser. B,20, No. 1, 20?40 (1976). · Zbl 0284.05110 · doi:10.1016/0095-8956(76)90063-0
[171] W. Haken, ?Combinatorial aspects of some mathematical problems,? Proc. Int. Congr. Math., Helsinki, 15?23 Aug., 1978, Vol. 2, Helsinki (1980), pp. 953?961. · Zbl 0424.05030
[172] F. Harary, D. Hsu, and Z. Miller, ?The biochromaticity of a tree,? Lect. Notes Math.,642, 26?246 (1978).
[173] F. Harary and A. Melter, ?On the metric dimension of a graph,? Ars. Combin.,2, 191?195 (1976). · Zbl 0349.05118
[174] F. Harary, A. Melter, U. N. Peled, and I. Tomescu, ?Boolean distance for graphs,? Discrete Math.,39, No. 2, 123?127 (1982). · Zbl 0477.05043 · doi:10.1016/0012-365X(82)90135-2
[175] F. Harary and J. Nieminen, ?Convexity in graphs,? J. Diff. Geom.,16, No. 2, 185?190 (1981). · Zbl 0493.05037 · doi:10.4310/jdg/1214436096
[176] F. Harary and A. Schwenk, ?Evolution of the path number of a graph. Covering and packing in graphs. II,? in: Graph Theory and Computing, Academic Press, New York (1972), pp. 39?45. · Zbl 0256.05115
[177] S. P. R. Hebbare, ?A class of distance convex simple graphs,? Ars. Combin.,7, 19?26 (1979).
[178] S. M. Hedetniemi, S. T. Hedetnieme, and P. J. Slater, ?Centers and medians of C(N)-trees,? Utilitas Math.,C21, May, 225?234 (1982).
[179] R. L. Hemminger, ?On reconstructing a graph,? Proc. Am. Math. Soc.,20, No. 1, 185?187 (1969). · Zbl 0164.54104 · doi:10.1090/S0002-9939-1969-0232696-4
[180] A. J. W. Hilton, ?On Vizing’s upper bound for the chromatic index of a graph,? Cahiers Centre Études Rech. Opér.,17, No. 2?4, 225?233 (1975).
[181] Tomio Hirata, Akira Maruoka, Masayuki Kimura, ?Efficient algorithm to solve the path cover problem for reducible flow graphs,? Int. Symp. Circuits and Syst. Proc., Tokyo, 1979, New York, N.Y., s.a., 637?640.
[182] A. M. Hobbs, ?Powers of graphs, line graphs, and total graphs,? Lect. Notes Math.,642, 271?285 (1978). · Zbl 0379.05046 · doi:10.1007/BFb0070384
[183] A. J. Hoffman, ?Eigenvalues and partitionings of edges of a graph,? Linear Algebra Appl.,5, No. 2, 137?146 (1972). · Zbl 0247.05125 · doi:10.1016/0024-3795(72)90023-7
[184] I. Holyer, ?The NP-completeness of edge-coloring,? SIAM J. Comput.,10, No. 4, 718?720 (1981). · Zbl 0473.68034 · doi:10.1137/0210055
[185] Y. Hong, ?An eigenvector condition for reconstructibility,? J. Combin. Theory Ser. B,32, No. 3, 353?354 (1982). · Zbl 0503.05047 · doi:10.1016/0095-8956(82)90012-0
[186] J. E. Hopcroft, R. E. Tarjan, J. Wong, ?Linear time algorithm for isomorphism of planar graphs,? Proc. Sixth ACM Symp. Theor. Comp., 172?184 (1974). · Zbl 0369.05028
[187] P. Horák and J. ?irán, ?Note on a new coloring number of a graph,? J. Graph Theory,4, No. 1, 111?113 (1980). · Zbl 0427.05032 · doi:10.1002/jgt.3190040113
[188] E. Howorka, ?A characterization of distance-hereditary graphs,? Q. J. Math.,28, No. 112, 417?420 (1977). · Zbl 0376.05040 · doi:10.1093/qmath/28.4.417
[189] E. Howorka, ?On metric properties of certain clique graphs,? J. Combin. Theory Ser. B,27, No. 1, 67?74 (1979). · Zbl 0337.05138 · doi:10.1016/0095-8956(79)90069-8
[190] E. Howorka, ?A characterization of Ptolemaic graphs,? J. Graph Theory,5, No. 3, 323?331 (1981). · Zbl 0437.05046 · doi:10.1002/jgt.3190050314
[191] Wien-Lian Hsu and G. L. Nemhauser, ?Easy and hard bottleneck location problems,? Discrete Appl. Math.,1, No. 3, 209?215 (1979). · Zbl 0424.90049 · doi:10.1016/0166-218X(79)90044-1
[192] X. L. Hubant, ?Strongly regular graphs,? Discrete Math.,13, No. 4, 357?381 (1975). · Zbl 0311.05122 · doi:10.1016/0012-365X(75)90057-6
[193] A. Itai, Y. Perl, and Y. Shiloach, ?The complexity of finding maximum disjoint paths with length constraints,? Networks,12, No. 3, 277?286 (1982). · Zbl 0504.68041 · doi:10.1002/net.3230120306
[194] B. Jackson and T. D. Parson, ?Longest cycles in r-regular r-connected graphs,? J. Combin. Theory Ser. B,32, No. 3, 231?245 (1982). · Zbl 0494.05033 · doi:10.1016/0095-8956(82)90001-6
[195] R. E. Waldner-Jamison, ?Partition numbers for trees and ordered sets,? Pac. J. Math.,96, No. 1, 115?140 (1981). · Zbl 0482.52010 · doi:10.2140/pjm.1981.96.115
[196] R. E. Waldner-Jamison and R. Nowakowski, ?A Helly theorem for convexity in graphs,? Discrete Math.,51, No. 1, 35?39 (1984). · Zbl 0548.05052 · doi:10.1016/0012-365X(84)90021-9
[197] M. Javdekar, ?Note on Choudum’s ?Chromatic bounds for a class of graphs,?? J. Graph Theory,4, No. 3, 265?266 (1980). · Zbl 0439.05020 · doi:10.1002/jgt.3190040303
[198] R. P. Jones, ?Hereditary properties and P-chromatic numbers,? London Math. Soc., Lect. Note Ser., No. 13, 83?88 (1974). · Zbl 0301.05109
[199] P. C. Kainen, ?A generalization of the 5-color theorem,? Proc. Am. Math. Soc.,45, No. 3, 450?453 (1974). · Zbl 0293.05111
[200] P. C. Kainen, ?Chromatic number and skewness,? J. Combin. Theory Ser. B,18, No. 1, 32?34 (1975). · Zbl 0298.05116 · doi:10.1016/0095-8956(75)90059-3
[201] R. M. Karp, ?Reducibility among combinatorial problems,? Complexity Comput. Computat., Proc. Symp., Yorktown Heights, N.Y. 1972, New York-London (1972), pp. 85?103.
[202] H. A. Kierstead and J. H. Schmerl, ?Some applications on Vizing’s theorem to vertex colorings of graphs,? Discrete Math.,45, No. 2?3, 277?285 (1983). · Zbl 0512.05027 · doi:10.1016/0012-365X(83)90043-2
[203] W. L. Kocay, ?2-reconstruction of trees,? Ars. Combin.,7, 97?134 (1979).
[204] W. L. Kocay and A. H. Ball, ?2-reconstruction of disconnected trees,? Ars. Combin.,6, 223?253 (1978). · Zbl 0439.05035
[205] A. V. Kostochka, ?Degree, girth and chromatic number,? in: Combinatorics, Vol. 2, Amsterdam e.a. (1978), pp. 679?696. · Zbl 0383.05017
[206] M. S. Krishnamoorthy and N. Deo, ?Node-deletion NP-complete problems,? SIAM J. Comput.,8, No. 4, 619?625 (1979). · Zbl 0423.05039 · doi:10.1137/0208049
[207] M. S. Krishnamoorthy and K. Parthasarathy, ?On the reconstruction of separable graphs from elementary contractions,? Discrete Math.,38, No. 2?3, 197?205 (1982). · Zbl 0473.05045 · doi:10.1016/0012-365X(82)90289-8
[208] V. R. Kulli and N. S. Annigeri, ?Reconstruction of a pair of connected graphs from their line-concatenations,? Lect. Notes Math.,885, 301?307 (1981). · Zbl 0477.05052 · doi:10.1007/BFb0092275
[209] Sukhamay Kundu, E. Sampathkumar, and V. N. Bhave, ?Reconstruction of a tree from its homomorphic images and other related transforms,? J. Combin. Theory Ser. B,20, No. 2, 117?123 (1976). · Zbl 0286.05103 · doi:10.1016/0095-8956(76)90002-2
[210] J. Larson, ?Some graphs with chromatic number three,? J. Combin. Theory Ser. B,26, No. 3, 317?322 (1979). · Zbl 0379.05029 · doi:10.1016/0095-8956(79)90006-6
[211] R. Laskar and D. Shier, ?On powers and centers of chordal graphs,? Discrete Appl. Math.,6, No. 2, 139?147 (1983). · Zbl 0521.05064 · doi:10.1016/0166-218X(83)90068-9
[212] J. Lauri, ?Edge-reconstruction of planar graphs with minimal valency 5,? J. Graph Theory,3, No. 3, 269?286 (1979). · Zbl 0438.05048 · doi:10.1002/jgt.3190030310
[213] J. Lauri, ?The reconstruction of maximal planar graphs. II. Reconstruction,? J. Combin. Theory Ser. B,30, No. 2, 196?214 (1981). · Zbl 0413.05036 · doi:10.1016/0095-8956(81)90064-2
[214] E. L. Lawler, ?A note on the complexity of the chromatic number problem,? Inf. Process. Lett.,5, No. 3, 66?67 (1976). · Zbl 0336.68021 · doi:10.1016/0020-0190(76)90065-X
[215] J. Lawrence, ?Covering the vertex set of a graph with subgraphs of smaller degree,? Discrete Math.,21, No. 1, 61?68 (1978). · Zbl 0371.05024 · doi:10.1016/0012-365X(78)90147-4
[216] F. T. Leighton, ?New lower bound techniques for VLSI,? Math. Systems Theory,17, No. 1, 47?70 (1984). · Zbl 0488.94048 · doi:10.1007/BF01744433
[217] L. Lesniak-Foster, ?Some recent results in Hamiltonian graphs,? J. Graph Theory,1, No. 1, 27?36 (1977). · Zbl 0353.05041 · doi:10.1002/jgt.3190010109
[218] R. B. Levow, ?Coloring restrictions,? Lect. Notes Math.,642, 347?352 (1978). · doi:10.1007/BFb0070391
[219] J. M. Lewis and M. Yannakakis, ?The node-deletion problem for hereditary properties is NP-complete,? J. Comput. System. Sci.,29, No. 2, 219?230 (1980). · Zbl 0436.68029 · doi:10.1016/0022-0000(80)90060-4
[220] D. R. Lick, ?Acyclic color functions on graphs,? Riv. Mat. Univ. Parma,1, 135?141 (1975(1977)).
[221] R. J. Lipton and R. E. Tarjan, ?Applications of a planar separator theorem,? 18th Annu. Symp. Found. Comput. Sci., Providence, R.I., 1977, New York, N.Y. (1977), pp. 162?170.
[222] A. Lubiw, ?Some NP-complete problems similar to graph isomorphism,? SIAM J. Comput.,10, No. 1, 11?21 (1981). · Zbl 0454.68025 · doi:10.1137/0210002
[223] G. S. Lueker and K. S. Booth, ?A linear time algorithm for deciding interval graph isomorphism,? J. Assoc. Comput. Mach.,26, No. 2, 183?195 (1979). · Zbl 0402.68050 · doi:10.1145/322123.322125
[224] E. M. Luks, ?Isomorphism of graphs of bounded valence can be tested in polynomial time,? J. Comput. System Sci.,25, No. 1, 43?65 (1982). · Zbl 0493.68064 · doi:10.1016/0022-0000(82)90009-5
[225] U. Mamber and M. Tompa, ?The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem,? 22nd Annu. Symp. Found. Comput. Sci., Nashville, Tenn., Oct. 28?30, 1981, New York, N.Y. (1981), pp. 220?227.
[226] A. Mansfield, ?The relationship between the computational complexities of legitimate deck and isomorphism problems,? Q. J. Math.,33, No. 131, 345?347 (1982). · Zbl 0503.68030 · doi:10.1093/qmath/33.3.345
[227] B. Manvel, ?On reconstruction of graphs,? Lect. Notes Math.,110, 207?214 (1969). · doi:10.1007/BFb0060119
[228] B. Manvel, ?Some basic observations on Kelly’s conjecture for graphs,? Discrete Math.,8, No. 2, 181?186 (1974). · Zbl 0285.05124 · doi:10.1016/0012-365X(74)90064-8
[229] B. Manvel, ?On reconstructuring graphs from their sets of subgraphs,? J. Combin. Theory Ser. B,21, No. 2, 156?165 (1976). · Zbl 0335.05129 · doi:10.1016/0095-8956(76)90056-3
[230] B. Manvel and M. Weinstein, ?Nearly acyclic graphs are reconstructible,? J. Graph Theory,2, No. 1, 25?39 (1978). · Zbl 0379.05043 · doi:10.1002/jgt.3190020105
[231] M. C. Marino and L. Puccio, ?Sul parametre ?s(G) di un grafo planare,? Riv. Mat. Univ. Parma,9, 9?13 (1983).
[232] D. Maru?i? and T. D. Parsons, ?Hamiltonian paths in vertex-symmetric graphs of order 5p,? Discrete Math.,42, No. 2?3, 227?242 (1982). · Zbl 0501.05041 · doi:10.1016/0012-365X(82)90220-5
[233] D. Maru?i? and T. D. Parsons, ?Hamiltonian paths in vertex-symmetric graphs of order 4p,? Discrete Math.,43, No. 1, 91?96 (1982).
[234] R. Mathon, ?A note on the graph isomorphism counting problem,? Inf. Process. Lett.,8, No. 3, 131?132 (1979). · Zbl 0395.68057 · doi:10.1016/0020-0190(79)90004-8
[235] H. A. Mauer, J. H. Sudborough, and E. Welzl, ?On the complexity of the general coloring problem,? Inf. Control,51, No. 2, 128?145 (1981). · Zbl 0502.68015 · doi:10.1016/S0019-9958(81)90226-6
[236] C. McDiarmid, ?Determining the chromatic number of a graph,? SIAM J. Comput.,8, No. 1, 1?14 (1979). · Zbl 0401.05043 · doi:10.1137/0208001
[237] B. D. McKay, ?Computer reconstruction of small graphs,? J. Graph Theory,1, No. 3, 281?283 (1977). · Zbl 0386.05045 · doi:10.1002/jgt.3190010309
[238] A. Meir and J. W. Moon, ?Path edge-covering constants for certain families of trees,? Utilitas Math.,14, 313?333 (1978).
[239] R. A. Melter and I. Tomescu, ?Remarks on distances in graphs,? An. Stiint. Univ. Iasi Sect. I a,27, No. 2, 407?410 (1981).
[240] R. A. Melter and I. Tomescu, ?On the boolean metric dimension of a graph,? Rev. Roum. Math. Pures Appl.,29, No. 5, 407?415 (1984).
[241] E. Mendelsohn, ?Every (finite) group is the group of automorphisms of a (finite) strongly regular graph,? Ars. Combin.,6, 75?86 (1978). · Zbl 0455.05035
[242] G. L. Miller, ?Riemann’s hypothesis and tests for primality,? J. Comput. System Sci.,13, No. 3, 300?317 (1976). · Zbl 0349.68025 · doi:10.1016/S0022-0000(76)80043-8
[243] G. L. Miller, ?Isomorphism testing for graphs of bounded genus,? Proc. 12th Annu. ACM Symp. Theory Comput., 225?235 (1980).
[244] G. L. Miller, ?Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus,? Inf. Control,56, No. 1?2, 1?20 (1983). · Zbl 0542.05056 · doi:10.1016/S0019-9958(83)80047-3
[245] G. L. Miller, ?Isomorphism of graphs which are pairwise k-separable,? Inf. Control,56, No. 1?2, 21?33 (1983). · Zbl 0546.05057 · doi:10.1016/S0019-9958(83)80048-5
[246] J. Mitchem, ?On the genus of graphs with Lick-White number k,? Proc. Am. Math. Soc.,69, No. 2, 349?354 (1978). · Zbl 0391.05023
[247] H. M. Mulder, ?The interval function of a graph,? Math. Centre Tracts, No. 132, Vol. IV (1980).
[248] M. Mulder, ?The structure of median graphs,? Discrete Math.,24, No. 2, 197?204 (1978). · Zbl 0394.05038 · doi:10.1016/0012-365X(78)90199-1
[249] V. Müller, ?Probabilistic reconstruction from subgraphs,? Comment. Math. Univ. Carolin.,17, No. 4, 709?719 (1976). · Zbl 0349.05121
[250] V. Müller, ?The edge reconstruction hypothesis is true for graphs with more than n log2 n edges,? J. Combin. Theory Ser. B,22, No. 3, 281?283 (1977). · Zbl 0319.05127 · doi:10.1016/0095-8956(77)90074-0
[251] L. Nebeský, ?Reconstruction of a tree from certain maximal proper subtrees,? ?asopis P?st. Mat.,99, No. 1, 44?48 (1974).
[252] L. Nebeský, ?On pancyclic line graphs,? Czechoslovak Math. J.,28, No. 4, 650?655 (1978).
[253] L. Nebeský, ?On squares of complementary graphs,? Math. Slovaca,30, No. 3, 247?249 (1980).
[254] G. A. Neufeld and J. Tartar, ?Generalized graph colorations,? SIAM J. Appl. Math.,29, No. 1, 91?98 (1975). · Zbl 0309.05112 · doi:10.1137/0129009
[255] J. Nieminen, ?Some observations on coverings of graphs,? Glas. Mat. Ser. III,10, No. 1, 2?8 (1975). · Zbl 0308.05118
[256] J. Nieminen, ?On path- and geodesic-convexity in digraphs,? Glas. Mat., No. 2, 193?197 (1981). · Zbl 0487.05031
[257] J. Nieminen, ?A characterization of median graphs,? Indian J. Pure Appl. Math.,15, No. 7, 727?730 (1984). · Zbl 0558.05052
[258] Takao Nishizeki, Takao Asano, and Takahiro Watanabe, ?An approximation algorithm for the Hamiltonian walk program on maximal planar graphs,? Discrete Appl. Math.,5, No. 2, 211?222 (1983). · Zbl 0511.05042 · doi:10.1016/0166-218X(83)90042-2
[259] S. Noorvash, ?Covering the vertices of a graph by vertex-disjoint paths,? Pac. J. Math.,58, No. 1, 159?168 (1975). · Zbl 0264.05122 · doi:10.2140/pjm.1975.58.159
[260] V. Nýdl, ?Finite graphs and digraphs which are not, reconstructible from their cardinality restricted subgraphs,? Comment. Math. Univ. Carolin.,22, No. 2, 281?287 (1981). · Zbl 0474.05052
[261] P. J. Owens, ?Cyclically 5-edge-connected cubic planar graphs and shortness coefficients,? J. Graph Theory,6, No. 4, 473?479 (1982). · Zbl 0502.05032 · doi:10.1002/jgt.3190060411
[262] H. Pahlings, ?On the chromatic number of skew graphs,? J. Combin. Theory Ser. B,25, No. 3, 303?306 (1978). · Zbl 0398.05035 · doi:10.1016/0095-8956(78)90006-0
[263] K. R. Parthasarathy and N. Srinivasan, ?Some general constructions of geodesic blocks,? J. Combin. Theory Ser. B,33, No. 2, 121?136 (1982). · Zbl 0488.05056 · doi:10.1016/0095-8956(82)90063-6
[264] B. Peroché, ?The path-numbers of some multipartite graphs,? in: Combinatorics ?79, Part 2, Amsterdam e.a. (1980), pp. 195?197.
[265] B. Peroché, ?NP-completeness of some problems of partitioning and covering in graphs,? Discrete Appl. Math.,8, No. 2, 195?208 (1984). · Zbl 0541.05048 · doi:10.1016/0166-218X(84)90101-X
[266] B. Pittel, ?On the probable behavior of some algorithms for finding stability number of a graph,? Math. Proc. Cambridge Philos. Soc.,92, No. 3, 511?526 (1982). · Zbl 0525.05052 · doi:10.1017/S0305004100060205
[267] J. Plesník, ?Two constructions of geodetic graphs,? Math. Slovaca,27, No. 1, 65?71 (1977).
[268] J. Plesník, ?A construction of geodetic blocks,? Acta Fac. Rerum Natur. Univ. Comen. Math., No.36, 47?60 (1980).
[269] J. Plesník, ?On the sum of all distances in a graph or digraph,? J. Graph Theory,8, No. 1, 1?21 (1984). · Zbl 0552.05048 · doi:10.1002/jgt.3190080102
[270] J. Plesník, ?A note on the complexity of finding regular subgraphs,? Discrete Math.,49, No. 2, 161?167 (1984). · Zbl 0567.05029 · doi:10.1016/0012-365X(84)90113-4
[271] J. Plesník, ?A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs,? J. Combin. Theory Ser. B,36, No. 3, 284?297 (1984). · Zbl 0527.05043 · doi:10.1016/0095-8956(84)90034-0
[272] M. Pouzet, ?Note sur le problème de Ulam,? J. Combin. Theory Ser. B,27, No. 3, 231?236 (1979). · Zbl 0349.05103 · doi:10.1016/0095-8956(79)90015-7
[273] A. Proskurowski, ?Centers of maximal outerplanar graphs,? J. Graph Theory,4, No. 1, 75?79 (1980). · Zbl 0401.05065 · doi:10.1002/jgt.3190040108
[274] A. Proskurowski, ?Centers of 2-trees,? in: Combinatorics ?79, Part 2, Amsterdam e.a. (1980), pp. 1?5. · Zbl 0449.05018
[275] N. J. Pullman, ?Clique coverings of graphs ? survey,? Lect. Notes Math.,1036, 72?85 (1983). · Zbl 0528.05048 · doi:10.1007/BFb0071509
[276] N. J. Pullman, ?Clique coverings of graphs. IV. Algorithms,? SIAM J. Comput.,13, No. 1, 57?75 (1984). · Zbl 0548.05050 · doi:10.1137/0213005
[277] S. Ramachandran, ?Nearly line regular graphs and their reconstruction,? SIAM J. Comput.,885, 391?405 (1981). · Zbl 0477.05053
[278] S. Ramachandran, ?On a new digraph reconstruction conjecture,? J. Combin. Theory Ser. B,31, No. 2, 143?149 (1981). · Zbl 0474.05053 · doi:10.1016/S0095-8956(81)80019-6
[279] S. Ramachandran, ?On reconstructuring separable digraphs,? Lect. Notes Math.,885, 406?409 (1981). · doi:10.1007/BFb0092286
[280] R. C. Read, ?A survey of graph generation techniques,? Lect. Notes Math.,884, 77?89 (1981). · Zbl 0471.05023 · doi:10.1007/BFb0091809
[281] J. H. Reif, ?Minimum s-t cut of a planar undirected network in O(n log2 (n)) time,? Lect. Notes Comput. Sci.,115, 56?67 (1981). · Zbl 0462.68046 · doi:10.1007/3-540-10843-2_5
[282] C. Savage and J. Ja’Ja’, ?Fast efficient parallel algorithms for some graph problems,? SIAM J. Comput.,10, No. 4, 682?691 (1981). · Zbl 0476.68036 · doi:10.1137/0210051
[283] E. F. Schmeichel and S. L. Hakimi, ?Pancyclic graphs and a conjecture of Bondy and Chvatal,? J. Combin. Theory Ser. B,17, No. 1, 22?34 (1974). · Zbl 0279.05120 · doi:10.1016/0095-8956(74)90043-4
[284] E. T. Schmidt, A Survey on Congruence Lattice Representations, B. G. Teubner, Leipzig (1982).
[285] U. Shumacher, ?An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter,? Networks,14, No. 1, 63?74 (1984). · Zbl 0547.05039 · doi:10.1002/net.3230140106
[286] D. Seinsche, ?On a property of the class of n-colorable graphs,? J. Combin. Theory Ser. B,16, No. 2, 191?193 (1974). · Zbl 0269.05103 · doi:10.1016/0095-8956(74)90063-X
[287] M. Sekanina and A. Sekaninová, ?Arbitrarily traceable Eulerian graph has the Hamiltonian square,? Arch. Math.,18, No. 2, 91?93 (1982). · Zbl 0503.05042
[288] J. Sheehan, ?The multiplicity of Hamiltonian circuits in a graph,? Recent Adv. Graph Theory, Proc. Symp. Prague, 1974, Academia, Praha (1975), pp. 477?480.
[289] Z. Skupie?, ?Hamiltonian shortage, path partitions of vertices, and matchings in a graph,? Colloq. Math.,36, No. 2, 305?317 (1976).
[290] Z. Skupie? and W. Zygmunt, ?On vertices and edges in maximum path-factors of a tree,? Fund. Math.,109, No. 2, 89?101 (1980).
[291] P. Slater, ?Leaves of trees,? Proc. 6th Southeast Conf. Combinatorics, Graph Theory and Comput., Boca Raton, 1975, Winnipeg (1975), pp. 549?559.
[292] P. Slater, ?Centers to centroids in graphs,? J. Graph Theory,2, No. 3, 209?222 (1978). · Zbl 0425.05021 · doi:10.1002/jgt.3190020304
[293] P. Slater, ?Path coverings of the vertices of a tree,? Discrete Math.,25, No. 1, 65?74 (1979). · Zbl 0391.05020 · doi:10.1016/0012-365X(79)90153-5
[294] P. Slater, ?Medians of arbitrary graphs,? J. Graph Theory,4, No. 4, 389?392 (1980). · Zbl 0446.05029 · doi:10.1002/jgt.3190040408
[295] P. Slater, ?Locating central paths in a graph,? Transp. Sci.,16, No. 1, 1?18 (1982). · doi:10.1287/trsc.16.1.1
[296] P. Slater, S. E. Goodman, and S. T. Hedetniemi, ?On the optimal Hamiltonian completion problem,? Networks,6, No. 1, 35?51 (1976). · Zbl 0323.05121 · doi:10.1002/net.3230060104
[297] M. Stadel, ?A remark on the time complexity of the subtree proglem,? Computing,19, No. 4, 297?302 (1978). · Zbl 0385.05029 · doi:10.1007/BF02252027
[298] S. Stahl, ?n-tuple colorings and associated graphs,? J. Combin. Theory Ser. B,20, No. 2, 185?203 (1976). · Zbl 0293.05115 · doi:10.1016/0095-8956(76)90010-1
[299] J. G. Stemple, ?Geodetic graphs of diameter two,? J. Combin. Theory Ser. B,17, No. 3, 266?280 (1974). · Zbl 0323.05122 · doi:10.1016/0095-8956(74)90033-1
[300] J. G. Stemple and M. E. Watkins, ?On planar geodetic graphs,? J. Combin. Theory,4, No. 2, 101?117 (1968). · Zbl 0153.54004 · doi:10.1016/S0021-9800(68)80035-3
[301] P. K. Stockmeyer, ?The falsity of the reconstruction conjecture for tournaments,? J. Graph Theory,1, No. 1, 19?25 (1977). · Zbl 0355.05026 · doi:10.1002/jgt.3190010108
[302] P. K. Stockmeyer, ?A census of nonreconstructable digraphs. I: six related families,? J. Combin. Theory Ser. B,31, No. 2, 232?239 (1981). · Zbl 0426.05039 · doi:10.1016/S0095-8956(81)80027-5
[303] J. W. Suurballe and R. E. Tarjan, ?A quick method for finding shortest pairs of dis-joint paths,? Networks,14, No. 2, 325?336 (1984). · Zbl 0542.90100 · doi:10.1002/net.3230140209
[304] E. R. Swart, ?The philosophical implications on the four-color problem,? Am. Math. Mon.,87, No. 9, 697?707 (1980). · Zbl 0464.05032 · doi:10.2307/2321855
[305] Hiromitsu Takahashi and Akira Matsuyama, ?An approximate solution for the Steiner problem in graphs,? Math. Jpn.,24, No. 6, 573?577 (1979). · Zbl 0435.05036
[306] K. Takamizawa, T. Nishizeki, and N. Saito, ?Linear-time computability of combinatorial problems on series-parallel graphs,? J. Assoc. Comput. Math.,29, No. 3, 623?641 (1982). · Zbl 0485.68055 · doi:10.1145/322326.322328
[307] R. E. Tarjan and A. E. Trojanowski, ?Finding a maximum independent set,? SIAM J. Comput.6, No. 3, 536?546 (1977). · Zbl 0357.68035 · doi:10.1137/0206038
[308] M. Tarsi, ?On the decomposition of a graph into stars,? Discrete Math.,36, No. 3, 299?304 (1981). · Zbl 0467.05054 · doi:10.1016/S0012-365X(81)80025-8
[309] H. M. Teichert, ?Hamiltonian properties of the lexicographic product of undirected graph: Elektron. Informationsverarb. Kybern.,19, No. 1?2, 66?69 (1983). · Zbl 0535.05039
[310] H. M. Teichert, ?On the pancyclicity of some product graphs,? Elektron. Informationsverarb. Kybern.,19, No. 7?8, 345?356 (1983). · Zbl 0576.05036
[311] H. M. Teichert, ?Conductivity and Hamiltonian properties of the disjunction of undirected graphs,? Elektron. Informationsverarb. Kybern.,19, No. 12, 611?623 (1983). · Zbl 0544.05046
[312] P. Terwilliger, ?The diameter of bipartite distance-regular graphs,? J. Combin. Theory Ser. B,32, No. 2, 182?188 (1982). · Zbl 0487.05038 · doi:10.1016/0095-8956(82)90034-X
[313] P. Terwilliger, ?Distance-regular graphs and (s, c, a, k)-graphs,? J. Combin. Theory Ser. B,34, No. 2, 151?164 (1983). · Zbl 0511.05052 · doi:10.1016/0095-8956(83)90015-1
[314] C. Thomassen, ?Hamiltonian connected tournaments,? Prepr. Ser. Mat. Inst. Aarhus. Univ., No. 13, 1?38 (1977?1978). · Zbl 0364.05026
[315] C. Thomassen, ?Graphs in which every path is contained in a Hamiltonian path,? J. Reine Angew. Math.,268?269, 271?282 (1974). · Zbl 0273.05121
[316] P. Tomasta, ?Note on linear arboricity,? Math. Slovaca (?SSR),32, No. 3, 239?242 (1982). · Zbl 0494.05047
[317] H. Yung Tsin and F. Y. Chin, ?Efficient parallel algorithms for a class of graph theoretic problems,? SIAM J. Comput.,13, No. 3, 580?599 (1984). · Zbl 0545.68060 · doi:10.1137/0213036
[318] W. T. Tutte, All the King’s Horses. Graph Theory and Related Topics, Academic Press, New York (1979), pp. 15?33.
[319] J. Philos.,76, No. 2, 57?83 (1979).
[320] P. Underground, ?On graphs with Hamiltonian squares,? Discrete Math.,21, No. 3, 323 (1978). · Zbl 0376.05037 · doi:10.1016/0012-365X(78)90164-4
[321] Kazuhiko Ushio, ?Bipartite decompositions of complete miltipartite graphs,? Hiroshima Math. J.,11, No. 2, 321?345 (1981). · Zbl 0482.05051
[322] Kazuhiko Ushio, Shinsei Tazawa, and Sumiyasu Yamamoto, ?On claw-decomposition of a complete multipartite graph,? Hiroshima Math. J.,8, No. 1, 207?210 (1978). · Zbl 0382.05022
[323] C. Van Nuffelen, ?On the rank of the adjacency matrix,? Probl. Comb. Théor. Graphes, Colloq., Orsay, 1976, Paris (1978), pp. 321?322.
[324] C. Van Nuffelen, ?Some bounds for fundamental numbers in graph theory,? Bull. Soc. Math. Belg. Ser. B,32, No. 2, 251?257 (1980). · Zbl 0468.05027
[325] C. Van Nuffelen, ?Rank, clique and chromatic number of a graph,? Lect. Notes Inf. Sci.,38, 605?611 (1982). · Zbl 0491.05042
[326] C. Van Nuffelen, ?Rank and diameter of a graph,? Bull. Soc. Math. Belg. Ser. B,34, No. 1, 105?111 (1982). · Zbl 0541.05043
[327] U. Vishkin, ?An optimal parallel connectivity algorithm,? Discrete Math.,9, No. 2, 197?207 (1984). · Zbl 0546.68044 · doi:10.1016/0166-218X(84)90019-2
[328] S. Wagon, ?A bound on the chromatic number of graphs without certain induced subgraphs,? J. Combin. Theory Ser. B,29, No. 3, 345?346 (1980). · Zbl 0457.05032 · doi:10.1016/0095-8956(80)90093-3
[329] Osamu Watanabe, ?A fast algorithm for finding all shortest paths,? Inf. Process. Lett.,13, No. 1, 1?3 (1981). · Zbl 0469.68070 · doi:10.1016/0020-0190(81)90139-3
[330] Osamu Watanabe, Tadashi Ae, and Akira Nakamura, ?On the node cover problem of planar graphs,? Int. Symp. Circuits and Syst. Proc., Tokyo, 1979, New York, N.Y., s.a., 78?81.
[331] Osamu Watanabe, Tadashi Ae, and Akira Nakamura, ?On the NP-hardiness of edge-deletion and contraction problems,? Discrete Appl. Math.,6, No. 1, 63?78 (1983). · Zbl 0511.68028 · doi:10.1016/0166-218X(83)90101-4
[332] P. M. Weichsel, ?On distance-regularity in graphs,? J. Combin. Theory Ser. B,32, No. 2, 156?161 (1982). · Zbl 0477.05047 · doi:10.1016/0095-8956(82)90031-4
[333] E. Welzl, ?Color-families are dense,? Theor. Comput. Sci.,17, No. 1, 29?41 (1981). · Zbl 0482.68063 · doi:10.1016/0304-3975(82)90129-3
[334] H. Whitney, ?2-isomorphic graphs,? Am. J. Math.,55, 245?254 (1933). · Zbl 0006.37005 · doi:10.2307/2371127
[335] A. Wigderson, ?Improving the performance guarantee for approximate graph coloring,? J. Assoc. Comput. Math.,30, No. 4, 729?735 (1983). · Zbl 0627.68057 · doi:10.1145/2157.2158
[336] H. S. Wilf, ?Backtrack: an 0(1) expected time algorithm for the graph coloring problem, Inf. Process. Lett.,18, No. 3, 119?121 (1984). · Zbl 0541.68020 · doi:10.1016/0020-0190(84)90013-9
[337] J. E. Williamson, ?Panconnected graphs. II,? Period Math. Hung.,8, No. 2, 105?116 (1977). · Zbl 0339.05110 · doi:10.1007/BF02018497
[338] W. W. Wong and C. K. Wong, ?Minimum k-Hamiltonian graphs,? J. Graph Theory,8, No. l, 155?165 (1984). · Zbl 0534.05040 · doi:10.1002/jgt.3190080118
[339] D. R. Woodall, ?A sufficient condition for Hamiltonian circuits,? J. Combin. Theory Ser. B,25, No. 2, 184?186 (1976). · Zbl 0322.05126 · doi:10.1016/0095-8956(78)90037-0
[340] D. R. Woodall, ?The four-color theorem,? Math. Spectrum,11, No. 3, 69?75 (1978?1979). · Zbl 0432.05025
[341] Sumiyasu Yamamoto, Hideto Ikedo, Shinsei Shige-eda, Kazuhiko Ushio, and Noboru Hamada, ?On claw-decomposition of complete graphs and complete bigraphs,? Hiroshima Math. J.,5, No. 1, 33?42 (1975). · Zbl 0297.05143
[342] M. Yannakakis, ?Edge-deletion problems,? SIAM J. Comput.,10, No. 2, 297?309 (1981). · Zbl 0468.05043 · doi:10.1137/0210021
[343] F. F. Yao, ?Graph 2-isomorphism is NP-complete,? Inf. Process. Lett.,9, No. 2, 68?72 (1979). · Zbl 0412.68036 · doi:10.1016/0020-0190(79)90130-3
[344] J. Zaks, ?Pairs of Hamiltonian circuits in 5-connected planar graphs,? J. Combin. Theory Ser. B,21, No. 2, 116?131 (1976). · Zbl 0309.05120 · doi:10.1016/0095-8956(76)90051-4
[345] T. Zamfirescu, ?Graphen, in welchen je zwei Eckpunkte von einem läng sten Weg vermieden werden,? Ann. Univ. Ferrara, Sez. VII,21, 17?24 (1975). · Zbl 0336.05114
[346] T. Zaslavsky, ?Signed graph coloring,? Discrete Math.,39, No. 2, 215?228 (1982). · Zbl 0487.05027 · doi:10.1016/0012-365X(82)90144-3
[347] T. Zaslavsky, ?Chromatic invariants of signed graphs,? Discrete Math.,42, No. 2?3, 287?312 (1982). · Zbl 0498.05030 · doi:10.1016/0012-365X(82)90225-4
[348] B. Zelinka, ?The bichromaticity of a graph,? Czechoslovak Math. J.,30, No. 4, 655?660 (1980). · Zbl 0477.05041
[349] B. Zelinka, ?Elongation in a graph,? Math. Slovaca (?SSR),32, No. 3, 291?296 (1982). · Zbl 0494.05034
[350] Yong-jin Zhu and Feng Tian, ?A generalization of the Bondy-Chvátal theorem on the k-closure,? J. Combin. Theory Ser. B,35, No. 3, 247?255 (1983). · Zbl 0537.05039 · doi:10.1016/0095-8956(83)90052-7
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.