Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 40
Volume 40, August 1995
- Chi Wang:
Competition graphs and resource graphs of digraphs. Ars Comb. 40 (1995) - Elaine T. Bell:
Decomposition of Kn into cycles of length at most fifty. Ars Comb. 40 (1995) - Marcel Erné, Kurt Stege:
Combinatorial applications of ordinal sum decompositions. Ars Comb. 40 (1995) - Yair Caro, Yehuda Roditty:
A zero-sum conjecture for trees. Ars Comb. 40 (1995) - T. Aaron Gulliver:
New optimal ternery linear codes of dimension 6. Ars Comb. 40 (1995) - Hyung Chan Jung:
On the product of some posets: jump number, greediness. Ars Comb. 40 (1995) - Dirk Keppens, Wim Mielants:
On the number of points on a plane algebraic curve over GF(q)[t]/t^n. Ars Comb. 40 (1995) - Thomas Kunkle, Dinesh G. Sarvate:
On ternary designs with a specified number of blocks with repeated elements. Ars Comb. 40 (1995) - David K. Garnick:
The irregularity Strength of m \times n grids for m, n>= 18. Ars Comb. 40 (1995) - T. A. Jenkyns, D. McCarthy:
Generating all k-subsets of {1, ..., n} with minimal changes. Ars Comb. 40 (1995) - Dal-Young Jeong:
On the face vectors of arrangements of curves. Ars Comb. 40 (1995) - Joseph Y.-T. Leung, W.-D. Wei:
Some properties of nonnegative integral matrices. Ars Comb. 40 (1995) - Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman:
On generalizing a theorem of Jung. Ars Comb. 40 (1995) - Anthony J. W. Hilton, J. Keith Dugdale:
Disconnection numbers, pizza cuts, and cycle rank. Ars Comb. 40 (1995) - Art S. Finbow, Bert L. Hartnell:
A characterization of parity graphs containing no cycle of order five or less. Ars Comb. 40 (1995) - Abdollah Khodkar:
Numbers of common triples in simple balanced ternary designs. Ars Comb. 40 (1995) - Martin Kochol:
Relatively narrow latin parallelpipeds that cannot be extended to a latin cube. Ars Comb. 40 (1995) - Ljubo Marangunic:
On involutions acting on symmetric (81, 16, 3)-block designs. Ars Comb. 40 (1995) - Peter Dankelmann, Lutz Volkmann:
New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Comb. 40 (1995) - Ibrahim Cahit:
Equitable tree labellings. Ars Comb. 40 (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-22 20:02 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:
