Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 41
Volume 41, December 1995
- Stathis Chadjiconstantinidis, Kiki Sotirakoglou:
Optimal completely randomized designs for a cyclic covariate model with even replication number. Ars Comb. 41 (1995) - A. H. Baartmans, Cantian Lin, Walter D. Wallis:
Symmetric and skew equivalence of Hadamard matrices of order 28. Ars Comb. 41 (1995) - Gerd Fricke, Stephen T. Hedetniemi, Michael A. Henning:
Distance independence domination in graphs. Ars Comb. 41 (1995) - Lutz Volkmann:
On graphs with equal domination and edge independence numbers. Ars Comb. 41 (1995) - W. D. Wallis, Wan-Di Wei:
On the spectrum on maximal k-multiple free sets of integers. Ars Comb. 41 (1995) - David K. Garnick, N. A. Nieuwejaar:
Total domination of the m×n chessboard by kings, crosses and knights. Ars Comb. 41 (1995) - Denise Sakai Troxell:
Minimizing the number of holes in 2-distant colorings. Ars Comb. 41 (1995) - Ian Anderson, Norman J. Finizio:
Cohen's theorem and Z-cycle whist tournaments. Ars Comb. 41 (1995) - Armen S. Asratian:
Some properties of graphs with local Ore condition. Ars Comb. 41 (1995) - Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt:
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995) - Edward Spence:
Five nondual 2-(41, 16, 6) designs with a trivial automorphism group. Ars Comb. 41 (1995) - Yair Caro:
Exact cuts and a simple proof of the zero graphs theorem. Ars Comb. 41 (1995) - Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Ch. Pietsch:
The closure of all subsets of {3, 4, ...10} which include 3. Ars Comb. 41 (1995) - Carla N. Purdy, R. Swaminathan:
On a characterization of series-parallel graphs. Ars Comb. 41 (1995) - John Charles Renaud:
A second approximation to the boundary function on union-closed collections. Ars Comb. 41 (1995) - Michael J. Gilpen, Donald L. Kreher:
A note on spanning trees in near d-angulations. Ars Comb. 41 (1995) - Adrian Riskin:
On the enumeration of polyhedral embeddings of Cartesian products of cycle. Ars Comb. 41 (1995) - Pawel Wlaz, Jerzy Zurawiecki:
An algorithm for the generation of M-sequences using universal circuit matrix. Ars Comb. 41 (1995) - Ciping Chen:
Binding number of graphs and [a, b]-factors. Ars Comb. 41 (1995) - Hong-Jian Lai, Hongyuan Lai:
The size of graphs with given edge inclusive connectivity. Ars Comb. 41 (1995) - Graham R. Brightwell, Edward R. Scheinerman:
The dual of a circle order is not necessarilty a circle order. Ars Comb. 41 (1995) - N. K. Rayburn:
Mengerian results for distance-n connectivity. Ars Comb. 41 (1995) - A. J. van Zanten:
The ranking problem of a Gray code for compositions. Ars Comb. 41 (1995) - Bolian Liu:
Multiexponents of tournament matrices. Ars Comb. 41 (1995) - Ahmed H. Assaf, L. P. S. Singh:
Tripacking of pairs by quintuples the case v=2 (mod 4). Ars Comb. 41 (1995) - Mirko Hornák, Roman Soták:
Observability of complete multipartite graphs with equipotent parts. Ars Comb. 41 (1995) - John W. Krussel:
Distinct degrees determined by subgraphs. Ars Comb. 41 (1995) - Ibrahim Cahit:
On harmonious tree labelings. Ars Comb. 41 (1995)
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-25 20:50 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:
