Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 51
Volume 51, February 1999
- F. Göbel, Cornelis Hoede:
Magic Labelings of Graphs. Ars Comb. 51 (1999) - Amram Meir, John W. Moon:
On the Bipartition Numbers of Random Trees, II. Ars Comb. 51 (1999) - Noboru Hamada:
The Nonexistence of Quaternary Linear Codes With Parameters [243, 5, 181], [248, 5, 185] and [240, 5, 179]. Ars Comb. 51 (1999) - B. J. Vowden, Donald A. Preece:
Some New Infinite Series of Freeman-Youden Rectangles. Ars Comb. 51 (1999) - William Klostermeyer:
Pushing Vertices and Orienting Edges. Ars Comb. 51 (1999) - Cai Heng Li:
Finite Abelian Groups with the m-DCI Property. Ars Comb. 51 (1999) - Yoshimi Egawa, Katsumi Inoue:
Radius of (2k-1)-Connected Graphs. Ars Comb. 51 (1999) - A. Donald Keedwell:
What is the size of the smallest latin square for which a weakly completable critical set of cells exists? Ars Comb. 51 (1999) - Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decomposition of Multigraphs into Isomorphic Graphs with Two Edges. Ars Comb. 51 (1999) - Keiichi Handa:
Bipartitie Graphs with Balanced (a, b)-Partitions. Ars Comb. 51 (1999) - Terry A. McKee:
An Inequality Characterizing Chordal Graphs. Ars Comb. 51 (1999) - Stewart W. Neufeld:
The Concept of Diameter in Exponents of Symmetric Primitive Graphs. Ars Comb. 51 (1999) - David A. Pike:
Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems. Ars Comb. 51 (1999) - Cornelis Hoede:
A Comparison of Some Conditions for Non-Hamiltonicity of Graphs. Ars Comb. 51 (1999) - Donald A. Preece, B. J. Vowden, Nicholas C. K. Phillips:
Double Youden rectangles of sizes p(2p+1) and (p+1)(2p+1). Ars Comb. 51 (1999) - Suh-Ryung Kim:
On the Inequality dk(G) <= k(G) + 1. Ars Comb. 51 (1999) - Hajo Broersma, Cornelis Hoede:
Another equivalent of the graceful tree conjecture. Ars Comb. 51 (1999) - Asad Ali Ali, William Staton:
The Extremal Question for Cycles with Chords. Ars Comb. 51 (1999) - Rao Li:
A Note on Hamiltonian Cycles in K(1, r)-Free Graphs. Ars Comb. 51 (1999) - G. Ram Kherwa, Jagdish Prasad, Bhagwandas:
Balanced Ternary Designs from any (v, b, r, k) Design. Ars Comb. 51 (1999) - Gholamreza B. Khosrovshahi, Rouzbeh Torabi:
Maximal Trades. Ars Comb. 51 (1999) - Klaus Metsch, Bridget S. Webb:
A Note on the Cycle Structures of Automorphisms of 2-(v, k, 1) Designs. Ars Comb. 51 (1999) - Bolian Liu:
Generalized Exponents of Primitive, Nearly Reducible Matrices. Ars Comb. 51 (1999) - John L. Goldwasser, Cun-Quan Zhang:
Permutation graphs and Petersen graph. Ars Comb. 51 (1999) - Bu Yue Hua, Zhang Ke Min:
Completely Strong Path-Connectivity of Local Tournaments. Ars Comb. 51 (1999) - T. Gangopadhyay:
Some Results on Packing Graphs in their Complements. Ars Comb. 51 (1999) - Anjing Qu:
On Complementary Consecutive Labelings of Octahedron. Ars Comb. 51 (1999) - Mohammad Mahdian, Ebadollah S. Mahmoodian:
A Characterization of Uniquely 2-List Colorable Graphs. Ars Comb. 51 (1999) - Yanxun Chang, Gennian Ge:
Some new large sets of KTS(v). Ars Comb. 51 (1999) - Iliya Bluskov:
New Simple 3-Designs on 26 and 28 Points. Ars Comb. 51 (1999)
a service of 
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-04-19 19:20 CEST 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:
