default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 47
Volume 47, December 1997
- Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23. Ars Comb. 47 (1997) - Daphne Der-Fen Liu, Roger K. Yeh:
On Distance Two Labellings of Graphs. Ars Comb. 47 (1997) - Alfred Menezes, Yihong Wu:
The Discrete Logarithm Problem in GL(n, q). Ars Comb. 47 (1997) - Wai Chee Shiu:
Decoding DeBruijn Arrays Constructed by the FMSS Method. Ars Comb. 47 (1997) - Tridib Kumar Dutta, Bimal K. Roy:
Construction of Symmetric Balanced Squares. Ars Comb. 47 (1997) - Masaaki Harada:
Weighing Matrics and Self-Dual Codes. Ars Comb. 47 (1997) - Charlie H. Cooke:
Several Resolvable BIB or PBIB Doubles Round Robin Tournament Designs. Ars Comb. 47 (1997) - Wai Chee Shiu, Y. P. Tang:
Existence of Ideal matrices. Ars Comb. 47 (1997) - Mordechai Lewin:
A Note Following a Remark of Harary Regarding a Certain Family of Sum Graphs. Ars Comb. 47 (1997) - Bert L. Hartnell, Carol A. Whitehead:
On k-packings of graphs. Ars Comb. 47 (1997) - John G. Gimbel, Michael A. Henning, Zsolt Tuza:
Switching Distance Graphs. Ars Comb. 47 (1997) - Ping Wang:
An Upper Bound for the (n, 5)-cages. Ars Comb. 47 (1997) - Peter Horák, Alexander Rosa, Jozef Sirán:
Maximal Orthogonal Latin Rectangles. Ars Comb. 47 (1997) - Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan:
On Bandwidth and Cyclic Bandwidth of Graphs. Ars Comb. 47 (1997) - Brian Peterson, Linda Valdes:
Derangements in Sylow Subgroups of Symmetric Groups. Ars Comb. 47 (1997) - J. Richard Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen:
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs. Ars Comb. 47 (1997) - Stefan Heiss:
A Note on the P3-Sequenceability of Finite Groups. Ars Comb. 47 (1997) - George Steiner:
A poset-based method for counting partitions and Ferrers diagrams. Ars Comb. 47 (1997) - Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer:
Local connectivity and cycle xtension in claw-free graphs. Ars Comb. 47 (1997) - Claudio L. Lucchesi, Maria Cecilia M. T. Giglio:
On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem. Ars Comb. 47 (1997) - Zhike Jiang:
On Rotational Steiner Triple Systems: Five, Seven and Eleven. Ars Comb. 47 (1997) - C. Christofi:
On the Number of 6 4 7 Double Youden Rectangles. Ars Comb. 47 (1997) - Bu Yue Hua, Zhang Ke Min:
On the Arc-Pancyclicity of Local Tournaments. Ars Comb. 47 (1997) - Serge Lawrencenko, Jingzhong Mao:
A Sharp Lower Bound for the Number of Connectivity-Redundant Nodes. Ars Comb. 47 (1997) - Ramesh S. Sankaranarayana:
A generalization of Favaron's theorem. Ars Comb. 47 (1997) - Yanxun Chang:
A construction of holey perfect Mendelsohn designs. Ars Comb. 47 (1997) - Krzysztof Giaro:
The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard. Ars Comb. 47 (1997) - David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley:
P3-Connected Graphs of Minimum Size. Ars Comb. 47 (1997) - Ruqun Shen, Feng Tian, Bing Wei:
Hamiltonicity of k-connected graphs with independent claws. Ars Comb. 47 (1997) - Christian Bey:
On incidence matrices of finite affine geometries. Ars Comb. 47 (1997)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
