- Email: [email protected]
166 (1997)
DISCRETE MATHEMATICS ELSEVIER
Discrete
Mathematics
165/166
(1997) 643-645
Author index to volumes 165/166 (1997) Abderrezzak, M.E.K., E. Flandrin, A. Harkat-Benhamdine and H. Li, DA-cyclesin l-claw-free graphs Achlioptas, D., The complexity of G-free colourability Alon, N., Zs. Tuza and M. Voigt, Choosability and fractional chromatic numbers Bang-Jensen, J. and G. Gutin, Alternating cycles and paths in edge-coloured multigraphs: A survey Berge, C., Motivations and history of some of my conjectures Bondy, J.A., Counting subgraphs: A new approach to the Caccetta-Haggkvist conjecture Boros, E. and 0. Cepek, On perfect 0, k 1 matrices Bouchakour, M. and A.R. Mahjoub, One-node cutsets and the dominating set polytope Brunat, J.M., M. Maureso and M. Mora, Characterization of c-circulant digraphs of degree two which are circulant Cepek, O., see E. Boros Charon, I., A. Gutnoche, 0. Hudry and F. Woirgard, New results on the computation of median orders Chvatal, V., In praise of Claude Berge Cordovil, R., Coloring matroids de Figueiredo, C.M.H., see H. Everett de Werra, D., Restricted coloring models for timetabling Delorme, C. and J.P. Tillich, Eigenvalues, eigenspaces and distances to subsets Deuber, W.A. and X. Zhu, The chromatic numbers of distance graphs Deza, M. and V. Grishukhin, The skeleton of the 120-cell is not 5-gonal Ding, G. and P.L. Hammer, Matroids arisen from matrogenic graphs Edmonds, J., M. Laurent and A. Schrijver, A minor-monotone graph parameter based on oriented matroids Erdiis, P., Some old and new problems in various branches of combinatorics Everett, H., C.M.H. de Figueiredo, C. Linhares-Sales, F. Maffray, 0. Porto and B.A. Reed, Path parity and perfection Favaron, 0. and Y. Redouane, Minimum independent generalized r-degree and independence number in K i,,+i-free graphs Flandrin, E., see M.E.K. Abderrezzak Fleischner, H., A numbering of the vertices of special networks Fouquet, J.-L., F. Maire, I. Rusu and H. Thuillier, On transversals in minimal imperfect graphs Fouquet, J.-L. and V. Giakoumakis, On semi-P,-sparse graphs Fournier, J.C.. Tiling pictures of the plane with dominoes Giakoumakis, V., F. Roussel and H. Thuillier, Scattering number and modular decomposition Giakoumakis, V., see J.-L. Fouquet Gimbel, J., M. Mahto and C. Virlouvet, Double total domination of graphs Gravier, S. and F. Maffray, Choice number of 3-colorable elementary graphs Grishukhin, V., see M. Deza Gropp, H., Blocking set free configurations and their relations to digraphs and hypergraphs Gutnoche, A., see I. Charon Gutin, G., see J. Bang-Jensen Gyori, E., Cb-free bipartite graphs and product representation of squares
ll- 20 21p 30 31- 38 39p 60 61l 70 71- 80 81-100 101-123 1255137 81llOO 139-153 3-- 9 1555160 2333252 161-170 171-194 195-204 20552 10 211-217 219-226 227723 1 2333252 2533261 ill 20 263-216 3Oll312 277-300 313-320 321-342 27773OC 3433351 353-358 205-2 10 359937Cl 139_15?’ 39p 60 371-375
644
Author index
Hadjiat, M. and J.F. Maurras, A strongly polynomial algorithm for the minimum cost tension problem Hamidoune, Y.O. and M.L. Vergnas, Directed switching games II: The Arborescence Game Hammer, P.L., see G. Ding Hansen, P., A. Hertz and N. Quinodoz, Splitting trees Harkat-Benhamdine, A., see M.E.K. Abderrezzak Hertz, A., see P. Hansen Hougardy, S., Perfect graphs with unique P,-structure Hudry, O., see I. Charon Klazar, M., Combinatorial aspects of Davenport-Schinzel sequences Laborde, J.M. and R.M. Madani, Generalized hypercubes and (0,2)-graphs Laurent, M., see J. Edmonds Leclerc, B., Families of chains of a poset and Sperner properties Li, H., M. Lu, F. Tian and B. Wei, Hamiltonicity of 2-connected claw-center independent graphs Li, H., see M.E.K. Abderrezzak Linhares-Sales, C., see H. Everett Llado, AS., see G. Ringel Lu, M., see H. Li Madani, R.M., see J.M. Laborde Maffray, F., see H. Everett Maffray, F., see S. Gravier Maheo, M., see J. Gimbel Mahjoub, A.R., see M. Bouchakour Maire, F., see J.-L. Fouquet Maureso, M., see J.M. Brunat Maurras, J.-F. and Y. Vaxes, Multicommodity network flow with jump constraints Maurras, J.F., see M. Hadjiat Milazzo, L., The monochromatic block number Monjardel, B., On a dependence relation in finite lattices Mora, M., see J.M. Brunat Miiller, H. and J.-X. Rampon, Partial orders and their convex subsets Nezetfil, J., A. Raspaud and E. Sopena, Colorings and girth of oriented planar graphs Padberg, M. and T.-Y. Sung, An analytic symmetrization of max flow-min cut Palisse, R., Subsets of a finite set that almost always intersect each other in 1 elements Payan, C., Empilement de cercles egaux dans un triangle equilateral: A propos d’une conjecture d’Erd6ssOler Perkovic, L. and B. Reed, Edge coloring regular graphs of high degree Porto, O., see H. Everett Prea, P., About weak connectivity Quinodoz, N., see P. Hansen Rampon, J.-X., see H. Miiller Raspaud, A., see J. NeHet?il Redouane, Y., see 0. Favaron Reed, B., see L. Perkovic Reed, B.A., see H. Everett Ringel, G., A.S. Llado and 0. Serra, On the tree number of regular graphs Roussel, F., see V. Giakoumakis Rusu, I., see J.-L. Fouquet Sachs, H., Graph Theory in Organic Chemistry: Problems and Methods in the Chemistry of Carbon Footballs and Tubes (Fullerenes) Sac& J.-F. and M. Wozniak, On graphs which contain each tree of given size Schrijver, A.. see J. Edmonds Serra, O., see G. Ringel Sopena, E., see J. Negetiil
377-394 3955402 211-217 403419 it- 20 403419 421430 139-l 53 431445 447459 219-226 461468 469479 ll- 20 233-252 587-595 469479 447459 2333252 353-358 343-35 1 101-123 301-312 1255137 481486 377-394 487496 497-505 1255137 507-517 519-530 531-545 547-553 555-565 567-578 233-252 579-586 403419 5077517 519-530 253-261 567-578 233-252 587-595 321-342 301-312 597-598 599-605 219-226 587-595 519-530
Author inde.x
Sung, T.-Y., see M. Padberg Thomassen, C., Dirac’s conjecture on Ks-subdivisions Thuillier, H., see J.-L. Fouquet Thuillier, H.. see V. Giakoumakis Tian, F., see H. Li Tillich, J.P., see C. Delorme Togni, O., Irregularity strength of the toroidal grid Tuza. Zs., see N. Alon Vaxes. Y., see J.-F. Maurras Vergnas, M.L., see Y.O. Hamidoune Virlouvet, C., see J. Gimbel Voigt, M., see N. Alon Wei, B., see H. Li Woirgard, F., see I. Charon Wojda, A.P. and I.A. Ziolo, Embedding digraphs of small size Wozniak, M., see J.-F. Sacle Yamasaki, Y., The arithmetic of reverse d positional games Zhu, X., see W.A. Deuber Zioto, I.A., see A.P. Wojda
645
531 545 607 -608 301 312 321-342 469 479 171 194 609 620 31 3x 481486 395 402 343 351 31 38 469 419 139 153 6’1 638 599 -605 6.39 641 l95~204 621 63X
Discrete
Mathematics
165/166
(1997) 643-645
Author index to volumes 165/166 (1997) Abderrezzak, M.E.K., E. Flandrin, A. Harkat-Benhamdine and H. Li, DA-cyclesin l-claw-free graphs Achlioptas, D., The complexity of G-free colourability Alon, N., Zs. Tuza and M. Voigt, Choosability and fractional chromatic numbers Bang-Jensen, J. and G. Gutin, Alternating cycles and paths in edge-coloured multigraphs: A survey Berge, C., Motivations and history of some of my conjectures Bondy, J.A., Counting subgraphs: A new approach to the Caccetta-Haggkvist conjecture Boros, E. and 0. Cepek, On perfect 0, k 1 matrices Bouchakour, M. and A.R. Mahjoub, One-node cutsets and the dominating set polytope Brunat, J.M., M. Maureso and M. Mora, Characterization of c-circulant digraphs of degree two which are circulant Cepek, O., see E. Boros Charon, I., A. Gutnoche, 0. Hudry and F. Woirgard, New results on the computation of median orders Chvatal, V., In praise of Claude Berge Cordovil, R., Coloring matroids de Figueiredo, C.M.H., see H. Everett de Werra, D., Restricted coloring models for timetabling Delorme, C. and J.P. Tillich, Eigenvalues, eigenspaces and distances to subsets Deuber, W.A. and X. Zhu, The chromatic numbers of distance graphs Deza, M. and V. Grishukhin, The skeleton of the 120-cell is not 5-gonal Ding, G. and P.L. Hammer, Matroids arisen from matrogenic graphs Edmonds, J., M. Laurent and A. Schrijver, A minor-monotone graph parameter based on oriented matroids Erdiis, P., Some old and new problems in various branches of combinatorics Everett, H., C.M.H. de Figueiredo, C. Linhares-Sales, F. Maffray, 0. Porto and B.A. Reed, Path parity and perfection Favaron, 0. and Y. Redouane, Minimum independent generalized r-degree and independence number in K i,,+i-free graphs Flandrin, E., see M.E.K. Abderrezzak Fleischner, H., A numbering of the vertices of special networks Fouquet, J.-L., F. Maire, I. Rusu and H. Thuillier, On transversals in minimal imperfect graphs Fouquet, J.-L. and V. Giakoumakis, On semi-P,-sparse graphs Fournier, J.C.. Tiling pictures of the plane with dominoes Giakoumakis, V., F. Roussel and H. Thuillier, Scattering number and modular decomposition Giakoumakis, V., see J.-L. Fouquet Gimbel, J., M. Mahto and C. Virlouvet, Double total domination of graphs Gravier, S. and F. Maffray, Choice number of 3-colorable elementary graphs Grishukhin, V., see M. Deza Gropp, H., Blocking set free configurations and their relations to digraphs and hypergraphs Gutnoche, A., see I. Charon Gutin, G., see J. Bang-Jensen Gyori, E., Cb-free bipartite graphs and product representation of squares
ll- 20 21p 30 31- 38 39p 60 61l 70 71- 80 81-100 101-123 1255137 81llOO 139-153 3-- 9 1555160 2333252 161-170 171-194 195-204 20552 10 211-217 219-226 227723 1 2333252 2533261 ill 20 263-216 3Oll312 277-300 313-320 321-342 27773OC 3433351 353-358 205-2 10 359937Cl 139_15?’ 39p 60 371-375
644
Author index
Hadjiat, M. and J.F. Maurras, A strongly polynomial algorithm for the minimum cost tension problem Hamidoune, Y.O. and M.L. Vergnas, Directed switching games II: The Arborescence Game Hammer, P.L., see G. Ding Hansen, P., A. Hertz and N. Quinodoz, Splitting trees Harkat-Benhamdine, A., see M.E.K. Abderrezzak Hertz, A., see P. Hansen Hougardy, S., Perfect graphs with unique P,-structure Hudry, O., see I. Charon Klazar, M., Combinatorial aspects of Davenport-Schinzel sequences Laborde, J.M. and R.M. Madani, Generalized hypercubes and (0,2)-graphs Laurent, M., see J. Edmonds Leclerc, B., Families of chains of a poset and Sperner properties Li, H., M. Lu, F. Tian and B. Wei, Hamiltonicity of 2-connected claw-center independent graphs Li, H., see M.E.K. Abderrezzak Linhares-Sales, C., see H. Everett Llado, AS., see G. Ringel Lu, M., see H. Li Madani, R.M., see J.M. Laborde Maffray, F., see H. Everett Maffray, F., see S. Gravier Maheo, M., see J. Gimbel Mahjoub, A.R., see M. Bouchakour Maire, F., see J.-L. Fouquet Maureso, M., see J.M. Brunat Maurras, J.-F. and Y. Vaxes, Multicommodity network flow with jump constraints Maurras, J.F., see M. Hadjiat Milazzo, L., The monochromatic block number Monjardel, B., On a dependence relation in finite lattices Mora, M., see J.M. Brunat Miiller, H. and J.-X. Rampon, Partial orders and their convex subsets Nezetfil, J., A. Raspaud and E. Sopena, Colorings and girth of oriented planar graphs Padberg, M. and T.-Y. Sung, An analytic symmetrization of max flow-min cut Palisse, R., Subsets of a finite set that almost always intersect each other in 1 elements Payan, C., Empilement de cercles egaux dans un triangle equilateral: A propos d’une conjecture d’Erd6ssOler Perkovic, L. and B. Reed, Edge coloring regular graphs of high degree Porto, O., see H. Everett Prea, P., About weak connectivity Quinodoz, N., see P. Hansen Rampon, J.-X., see H. Miiller Raspaud, A., see J. NeHet?il Redouane, Y., see 0. Favaron Reed, B., see L. Perkovic Reed, B.A., see H. Everett Ringel, G., A.S. Llado and 0. Serra, On the tree number of regular graphs Roussel, F., see V. Giakoumakis Rusu, I., see J.-L. Fouquet Sachs, H., Graph Theory in Organic Chemistry: Problems and Methods in the Chemistry of Carbon Footballs and Tubes (Fullerenes) Sac& J.-F. and M. Wozniak, On graphs which contain each tree of given size Schrijver, A.. see J. Edmonds Serra, O., see G. Ringel Sopena, E., see J. Negetiil
377-394 3955402 211-217 403419 it- 20 403419 421430 139-l 53 431445 447459 219-226 461468 469479 ll- 20 233-252 587-595 469479 447459 2333252 353-358 343-35 1 101-123 301-312 1255137 481486 377-394 487496 497-505 1255137 507-517 519-530 531-545 547-553 555-565 567-578 233-252 579-586 403419 5077517 519-530 253-261 567-578 233-252 587-595 321-342 301-312 597-598 599-605 219-226 587-595 519-530
Author inde.x
Sung, T.-Y., see M. Padberg Thomassen, C., Dirac’s conjecture on Ks-subdivisions Thuillier, H., see J.-L. Fouquet Thuillier, H.. see V. Giakoumakis Tian, F., see H. Li Tillich, J.P., see C. Delorme Togni, O., Irregularity strength of the toroidal grid Tuza. Zs., see N. Alon Vaxes. Y., see J.-F. Maurras Vergnas, M.L., see Y.O. Hamidoune Virlouvet, C., see J. Gimbel Voigt, M., see N. Alon Wei, B., see H. Li Woirgard, F., see I. Charon Wojda, A.P. and I.A. Ziolo, Embedding digraphs of small size Wozniak, M., see J.-F. Sacle Yamasaki, Y., The arithmetic of reverse d positional games Zhu, X., see W.A. Deuber Zioto, I.A., see A.P. Wojda
645
531 545 607 -608 301 312 321-342 469 479 171 194 609 620 31 3x 481486 395 402 343 351 31 38 469 419 139 153 6’1 638 599 -605 6.39 641 l95~204 621 63X