Volume 83, April 2007
- Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Extremal bipartite graphs with high girth.
- Yan Xu, Yanpei Liu:
Counting pan-fan maps on nonorientable surfaces.
- Marco Liverani, Aurora Morgana, Célia Picinin de Mello:
The K-behaviour of p-trees.
- Yahui Hu, Pingzhi Yuan, Weijun Liu:
The k-exponents of Primitive, Nearly Reducible Matrices.
- William Kocay:
Non-Fano Quads in Finite Projective Planes.
- Iwona Wloch:
On imp-sets, kernels by monochromatic paths of the duplication.
- Yahui Hu:
The generalized exponent sets of primitive, minimally strong digraphs (II).
- Dalibor Froncek, Tereza Kovarova:
2n-cyclic Blended Labeling of Graphs.
- Nicholas A. Loehr:
The Major Index Specialization of the q, t-Catalan.
- Guoping Wang, Qiongxiang Huang:
The Edge Choosability of Cn x Pm.
- Malgorzata Moczurad, Wlodzimierz Moczurad:
Asymptotic density of brick and word codes.
- Gaowen Xi:
Summation of Reciprocals Related to l-th Power of Generalized Fibonacci Sequences.
- Jason Brown, Richard Hoshino:
The Ehrenfeucht-Fraisse Game for Paths and Cycles.
- Zeev Nutov, Masao Tsugaki:
On (t, k)-shredders in k-connected graphs.
- Ralph Gordon Stanton:
Four Colour Classes in Projective Planes with Non-Fano Quads.
- John L. Goldwasser, William Klostermeyer:
Odd and Even Dominating Sets with Open Neighborhoods.
- Jihui Wang, Guizhen Liu:
Some Results on Fractional Edge Coloring of Graphs.
- Shailesh K. Tipnis, Michael Plantholt:
On a well-spread halving of regular multigraphs.
- Anuradha Sharma, Gurmeet K. Bakshi, Madhu Raka:
Irreducible cyclic codes of length 2pn.
- Shu-Guang Guo:
On the Spectral Radius of Unicyclic Graphs with n Vertices and Edge Independence Number q.
- Jun-Ming Xu, Tao Zhou, Ye Du, Jun Yan:
A New Upper Bound On Forwarding Index of Graphs.
- Peter Dankelmann, Lutz Volkmann:
Average distance in bipartite tournaments.
- Alka V. Kanetkar, S. S. Sane:
Graceful Labeling Of A Family Of Quasistars With Paths In Arithmetic Progression.
- Jun-Ming Xu, Min Lu, Ying-Mei Fan:
The Restricted Edge-Connectivity of de Bruijn Undirected Graphs.
- Arie Bialostocki, David J. Grynkiewicz:
On the Intersection of two m-sets and the Erdos-Ginzburg-Ziv Theorem.
- S. Ramachandran, S. Monikandan:
All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
- Zhizheng Zhang, Xiaoli Ye:
A Characterization of the Generalized Lah Matrix.
- Yeow Meng Chee:
A New Lower Bound for A(17, 6, 6).
- Arnold Knopfmacher, Helmut Prodinger:
The Last Descent In Samples Of Geometric Random Variables And Permutations.
- Andrea Vietri:
Erratum: a little emendation to the graceful labelling of the Generalized Petersen Graph P8t, 3 when t = 5.
Last update Fri May 24 20:01:21 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
