Volume 77,
October 2005
- Amitabha Tripathi, Sujith Vijay:
Closest Approximations to Real Numbers.
- Xue-Gang Chen, De-Xiang Ma, Liang Sun:
A note on graphs with largest total k-domination number.
- Anders Claesson, Toufik Mansour:
Enumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns.
- Jonah Blasiak, Jennifer M. Rowe, Lorenzo Traldi, Oded Yacobi:
Several definitions of matroids.
- Kiran R. Bhutani, Bilal Khan:
Distance Between Graphs Using Graph Labelings.
- Wei-Fan Wang, Ko-Wei Lih:
List Coloring Halin Graphs.
- Darrin D. Frey, James A. Sellers:
Properties for a Certain Family of Knot Diagrams.
- Jonathan Leech:
Magic Squares, Finite Planes and Simple Quasilattices.
- Debra L. Boutin:
Isometrically Embedded Graphs.
- Chariya Uiyyasathian, Kathryn Fraughnaugh:
Maximal-clique Partitions of Different Sizes.
- Dong Geon Kim:
A Decoding Scheme for the 4-ary Lexicodes with dm=4.
- Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam:
On The Trees Whose 2-Step Competition Numbers Are Two.
- Dale Peterson:
Associated Graphs of p-dimensional (0, 1)-matrices.
- Peter Dankelmann, Ortrud R. Oellermann:
Degree Sequences of Optimally Edge-Connected Multigraphs.
- Mark Ramras:
Bipartite Dominating Sets in Hypercubes.
- Nam-Po Chiang, Mao-Feng Huang:
Graph Operations and Point-Distinguishing Chromatic Indices.
- Endre Boros, Vladimir Gurvich, Ying Liu:
Comparison of Convex Hulls and Box Hulls.
- Hua-ming Xing, Liang Sun, Xue-Gang Chen:
On a generalization of signed total dominating functions of graphs.
- Juan Manuel Marín, Alberto Márquez, Maria Pastora Revuelta Marchena:
Matricial construction of k-colourings on square lattice.
- Koichi Betsumiya, YoungJu Choie:
Ozeki Polynomials and Jacobi Forms.
- Mahesh M. Andar, Samina Boxwala, Nirmala B. Limaye:
On the Cordiality of the t-ply Pt(u, v).
- Kwang-Wu Chen:
Applications Related to the Generalized Seidel Matrix .
- Nándor Sieben:
Avoidable Sets in The Bicyclic Inverse Semigroup.
- Peter Dankelmann, Lutz Volkmann:
Average distance in k-connected tournaments.
- Peter Jenkins:
Embedding a restricted class of partial K4-designs.
- Paul A. Russell:
Hamilton Paths in Certain Arithmetic Graphs.
- Dingjun Lou, Wei Wang:
An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.
Last update Fri May 25 08:55:01 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
