Discrete Mathematics, Volume 72

Volume 72, Numbers 1-3, December 1988

• Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Yousef Alavi, Fred Buckley, Marc Shamula, Sergio Ruiz:
  Highly irregular m-chromatic graphs. 3-13
  Electronic Edition (link) BibTeX
• Noga Alon, Fan R. K. Chung:
  Explicit construction of linear sized tolerant networks. 15-19
  Electronic Edition (link) BibTeX
• Béla Bollobás:
  Sorting in rounds. 21-28
  Electronic Edition (link) BibTeX
• C. C. Chen:
  On edge-Hamiltonian property of Cayley graphs. 29-33
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar:
  Gallai theorems for graphs, hypergraphs, and set systems. 35-47
  Electronic Edition (link) BibTeX
• Charles J. Colbourn:
  Edge-packing of graphs and network reliability. 49-61
  Electronic Edition (link) BibTeX
• Italo J. Dejter, J. Cordova, J. A. Quintana:
  Two hamilton cycles in bipartite reflective kneser graphs. 63-70
  Electronic Edition (link) BibTeX
• Chai-Ling Deng, Chong-Keang Lim:
  A result on generalized latin rectangles. 71-80
  Electronic Edition (link) BibTeX
• Paul Erdös:
  Problems and results in combinatorial analysis and graph theory. 81-92
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Edward T. Ordman:
  Clique partitions and clique coverings. 93-101
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  Extremal theory and bipartite graph-tree Ramsey numbers. 103-112
  Electronic Edition (link) BibTeX
• Siemion Fajtlowicz:
  On conjectures of Graffiti. 113-118
  Electronic Edition (link) BibTeX
• Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  Small order graph-tree Ramsey numbers. 119-127
  Electronic Edition (link) BibTeX
• Les R. Foulds, R. W. Robinson:
  Enumerating phylogenetic trees with multiple labels. 129-139
  Electronic Edition (link) BibTeX
• Ove Frank:
  Triad count statistics. 141-149
  Electronic Edition (link) BibTeX
• Severino V. Gervacio:
  Score sequences: Lexicographic enumeration and tournament construction. 151-155
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs:
  Problems on chain partitions. 157-162
  Electronic Edition (link) BibTeX
• Yahya Ould Hamidoune, Michel Las Vergnas:
  A solution to the Misère Shannon switching Game. 163-166
  Electronic Edition (link) BibTeX
• Takayuki Hibi, Hiroshi Narushima, Morimasa Tsuchiya, Kei-ichi Watanabe:
  A graph-theoretical characterization of the order complexes on the 2-sphere. 167-174
  Electronic Edition (link) BibTeX
• Cornelis Hoede:
  Hard graphs for the maximum clique problem. 175-179
  Electronic Edition (link) BibTeX
• Noboru Ito:
  Doubly regular asymmetric digraphs. 181-185
  Electronic Edition (link) BibTeX
• Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano:
  Ordering of the elements of a matroid such that its consecutive w elements are independent. 187-194
  Electronic Edition (link) BibTeX
• Fumio Kitagawa, Hideto Ikeda:
  An existential problem of a weight- controlled subset and its application to school timetable construction. 195-211
  Electronic Edition (link) BibTeX
• W. L. Kocay, Zeke Ming Lui:
  More non-reconstructible hypergraphs. 213-224
  Electronic Edition (link) BibTeX
• K. M. Koh, K. S. Poh:
  Constructions of sensitive graphs which are not strongly sensitive. 225-236
  Electronic Edition (link) BibTeX
• Pierre Leroux, Xavier Gérard Viennot:
  Combinatorial resolution of systems of differential equations. IV. separation of variables. 237-250
  Electronic Edition (link) BibTeX
• Feodor Loupekine, John J. Watkins:
  Labeling angles of planar graphs. 251-256
  Electronic Edition (link) BibTeX
• Tomasz Luczak, Zbigniew Palka:
  Maximal induced trees in sparse random graphs. 257-265
  Electronic Edition (link) BibTeX
• W. Mader:
  Generalizations of critical connectivity of graphs. 267-283
  Electronic Edition (link) BibTeX
• Hiroshi Maehara:
  On the euclidean dimension of a complete multipartite graph. 285-289
  Electronic Edition (link) BibTeX
• Izumi Miyamoto:
  Computation of some Cayley diagrams. 291-293
  Electronic Edition (link) BibTeX
• Tsuyoshi Nishimura:
  Short cycles in digraphs. 295-298
  Electronic Edition (link) BibTeX
• Krzysztof Nowicki, John C. Wierman:
  Subgraph counts in random graphs using incomplete u-statistics methods. 299-310
  Electronic Edition (link) BibTeX
• Michael D. Plummer:
  Toughness and matching extension in graphs. 311-320
  Electronic Edition (link) BibTeX
• K. B. Reid:
  Bipartite graphs obtained from adjacency matrices of orientations of graphs. 321-330
  Electronic Edition (link) BibTeX
• Mari-Jo P. Ruiz:
  C_n-factors of group graphs. 331-336
  Electronic Edition (link) BibTeX
• Maciej M. Syslo:
  An algorithm for solving the jump number problem. 337-346
  Electronic Edition (link) BibTeX
• Hoon heng Teh, Meng Fang Foo:
  Large scale network analysis with applications to transportation, communication and inference networks. 347-353
  Electronic Edition (link) BibTeX
• Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh:
  On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. 355-360
  Electronic Edition (link) BibTeX
• Kazuhiko Ushio:
  P₃-Factorization of complete bipartite graphs. 361-366
  Electronic Edition (link) BibTeX
• Andrew Vince:
  n-Graphs. 367-380
  Electronic Edition (link) BibTeX
• Jianfang Wang:
  On point-linear arboricity of planar graphs. 381-384
  Electronic Edition (link) BibTeX
• Toshihiro Watanabe:
  On the Littlewood-Richardson rule in terms of lattice path combinatorics. 385-390
  Electronic Edition (link) BibTeX
• Earl Glen Whitehead Jr.:
  Chromatic polynomials of generalized trees. 391-393
  Electronic Edition (link) BibTeX
• H. P. Yap:
  Packing of graphs - a survey. 395-404
  Electronic Edition (link) BibTeX
• Zhang Fu-ji, Guo Xiao-feng, Chen Rong-si:
  Z-transformation graphs of perfect matchings of hexagonal systems. 405-415
  Electronic Edition (link) BibTeX