Volume 69, October 2003

• 
  Akira Saito, Tomoki Yamashita: A Note on Dominating Cycles in Tough Graphs.
• 
  Shung-Liang Wu: New Families of Sequential Graphs.
• 
  Alois Panholzer: The Height Distribution of Nodes in Non-Crossing Trees.
• 
  Garth Isaak, Kathryn L. Nyman, Ann N. Trenk: A Hierarchy of Classes of Bounded Bitolerance Orders.
• 
  Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela: Complete bipartite free graphs.
• 
  Phyllis Chinn, Ralph Grimaldi, Silvia Heubach: The Frequency of Summands of a Particular Size in Palindromic Compositions.
• 
  Stelios Georgiou, Christos Koukouvinos: On equivalence of Hadamard matrices and projection properties.
• 
  W. Edwin Clark, Mourad E. H. Ismail, Stephen Suen: Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture.
• 
  A. Panayotolpoulos, A. Sapounakis: On Motzkin words and noncrossing partitions.
• 
  I. D. Gray, Jim A. MacDougall, R. J. Simpson, Walter D. Wallis: Vertex-Magic Total Labelings of Complete Bipartite Graphs.
• 
  M. M. Jaradat: On The Hamiltonian Decomposition of Special Product of Graphs.
• 
  James A. Sellers: Parity Results for p-Regular Partitions with Distinct Parts.
• 
  Sheng Bau, Michael A. Henning, Peter Dankelmann: Average lower independence in trees and outerplanar graphs.
• 
  Tomoki Nakamigawa: A Note on the Decomposition Dimension of Complete Graphs.
• 
  Clark Kimberling: A Run-length Operator on Partitions of Integers, Applied to Inventory Chains.
• 
  Daphne Der-Fen Liu, Xuding Zhu: Circulant Distant Two Labeling and Circular Chromatic Number.
• 
  Frank Rubin: Improved Knight Coverings.
• 
  Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Barbara M. Maenhaut, Ralph Gordon Stanton: More on exact bicoverings of 12 points.
• 
  Masakazu Nihei: Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph.
• 
  Dingjun Lou, Akira Saito, Lihua Teng: To Determine 1-Extendable Graphs and its Algorithm.
• 
  Erfang Shan, Moo Young Sohn, Liying Kang: Upper bounds on signed 2-independence number of graphs.
• 
  V. Swaminathan, P. Thangaraju: Phi-Strong (weak) domination in a graph.
• 
  Kenneth J. Roblee: Triangle-Free Regular Graphs as an Extremal Family.
• 
  David C. Fisher: On the n x n Knight Cover Problem.
• 
  Stephen G. Hartke, Aparna W. Higgins: Minimum Degree Growth of the Iterated Line Graph.
• 
  Eduardo Sany Laber, Emerson L. Monte Carmelo: A Note on multicolor bipartite Ramsey numbers for K_{2, n}.
• 
  Michael Minic, Rebecca Calahan Zijlstra: Steiner Triple Systems with Automorphism Type [1, 0, 0, 0, 0, 0, 0, t, 0, ...0, 1, 0, ...0].
• 
  Amir Daneshgar, Reza Naserasr: On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.

last updated on Thu May 23 03:54:35 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page