Discrete Mathematics, Volume 41

Volume 41, Number 1, 1982

• Douglas Bauer, Ralph Tindell:
  Graphs isomorphic to subgraphs of their line-graphs. 1-6
  
• I. Debroey, Frank De Clerck:
  Non-trivial GammaDelta-regular graphs. 7-15
  
• Ryoh Fuji-Hara, Scott A. Vanstone:
  Orthogonal resolutions of lines in AG(n, q). 17-28
  
• Roland Häggkvist, Carsten Thomassen:
  Circuits through specified edges. 29-34
  
• Joseph Douglas Horton:
  On two-factors of bipartite regular graphs. 35-41
  
• Vikram Jha:
  On subgroups and factor groups of GL(n, q) acting on spreads with the same characteristic. 43-51
  
• Oscar Moreno:
  On primitive elements of trace equal to 1 in GF(2^m). 53-56
  
• Yossi Shiloach, Uzi Vishkin, Shmuel Zaks:
  Golden ratios in a pairs covering problem. 57-65
  
• Andrew Thomason:
  Critically partitionable graphs II. 67-77
  
• Cun-Quan Zhang:
  Arc-disjoint circuits in digraphs. 79-96
  
• David A. Gregory, Norman J. Pullman:
  On a clique covering problem of orlin. 97-99
  
• M. R. Sridharan, O. T. George:
  On the strong perfect graph conjecture and critical graphs. 101-104
  
• Hortensia Galeana-Sánchez:
  A counterexample to a conjecture of meyniel on kernel-perfect graphs. 105-107
  
• Patricia Vanden Cruyce:
  A characterization of the n-cube by convex subgraphs. 109-110
  

Volume 41, Number 2, 1982

• B. Devadas Acharya:
  Connected graphs switching equivalent to their iterated line graphs. 115-122
  
• David W. Barnette:
  Nonconvex vertices of polyhedral 2-manifolds. 123-130
  
• Marilyn Breen:
  A decomposition theorem for chi₁-convex sets. 131-138
  
• Chong-Yun Chao, George A. Novacky:
  On maximally saturated graphs. 139-143
  
• Philippe Flajolet:
  On congruences and continued fractions for some classical combinatorial quantities. 145-153
  
• Mourad E. H. Ismail, Donald Stewart:
  On Dumont's polynomials. 155-160
  
• Ferenc Juhász:
  On the asymptotic behaviour of the spectra of non-symmetric random (0, 1) matrices. 161-165
  
• Daniel J. Kleitman, Kenneth J. Winston:
  On the number of graphs without 4-cycles. 167-172
  
• Pierre Masai:
  Two conjectures of Grünbaum on arrangements of curves. 173-180
  
• James G. Oxley:
  On some extremal connectivity results for graphs and matroids. 181-198
  
• Phillip Schultz:
  Enumerations of rooted trees with an application to group presentations. 199-214
  
• P. Engel:
  On the enumeration of polyhedra. 215-218
  
• Michel Habib, Bernard Péroche:
  Some problems about linear arboricity. 219-220
  

Volume 41, Number 3, 1982

• S. A. Burr, Jerrold W. Grossman:
  Ramsey numbers of graphs with long tails. 223-227
  
• Mao-cheng Cai:
  Minimally k-connected graphs of low order and maximal size. 229-234
  
• David E. Dobbs:
  Posets admitting a unique order-compatible topology. 235-240
  
• Marie-Claude Heydemann:
  Degrees and cycles in digraphs. 241-251
  
• Henry Martyn Mulder:
  Interval-regular graphs. 253-269
  
• R. Glenn Powers:
  Some Asymptotic ith Ramsey numbers. 271-279
  
• Eli Shamir, Eli Upfal:
  One-factor in random graphs based on vertex choice. 281-286
  
• M. Stern:
  Semimodularity in lattices of finite length. 287-293
  
• Paul Terwilliger:
  Eigenvalue multiplicities of highly symmetric graphs. 295-302
  
• Melvin C. Thornton:
  Regular elements in sandwich semigroups of binary relations. 303-307
  
• Manfred Walter:
  Construction of matroidal families by partly closed sets. 309-315
  
• Doron Zeilberger:
  A combinatorial proof of Dyson's conjecture. 317-321
  
• Yahya Ould Hamidoune:
  On a conjecture of entringer and slater. 323-326
  
• A. P. Huhn, L. Megyesi:
  On discount residue classes. 327-330
  
• C. D. Godsil: Problem 25. 331-332
• Douglas R. Stinson: Problem 26. 332

Last update Mon May 20 00:51:52 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page