Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 59
Volume 59, April 2001
- Marilyn Breen:
A Krasnoselskii Theorem for Permissible Paths Whose Edges Are Parallel to Three Given Vectors in the Plane. Ars Comb. 59 (2001)
- Spencer P. Hurd, Dinesh G. Sarvate:
All c-Bhaskar Rao Designs With Block Size 3 and c >= -1 Exist. Ars Comb. 59 (2001) - Guantao Chen, Joan P. Hutchinson, Wiktor Piotrowski, Warren E. Shreve, Bing Wei:
Degree Sequences with Repeated Values. Ars Comb. 59 (2001) - Zhang Cheng-heng:
On The Fibonacci Matrix Of Order 2^k Sequence {F^(2k)n}. Ars Comb. 59 (2001) - Sandi Klavzar, Uros Milutinovic, Ciril Petr:
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem. Ars Comb. 59 (2001) - Shannon L. Fitzpatrick, Richard J. Nowakowski:
Copnumber Of Graphs With Strong Isometric Dimension Two. Ars Comb. 59 (2001) - Makiko Watanabe:
On some characterization of strongly regular graphs. Ars Comb. 59 (2001) - Charles Laywine, Gary L. Mullen:
A Table of Lower Bounds for the Number of Mutually Orthogonal Frequency Squares. Ars Comb. 59 (2001) - Allen G. Fuller:
{K(1, 3), Z2}-Free Graphs of Low Connectivity. Ars Comb. 59 (2001) - Eddie Cheng, Marc J. Lipman, Hyungju Park:
Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars. Ars Comb. 59 (2001) - Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination critical trees with respect to relative complements. Ars Comb. 59 (2001) - J. A. Dias da Silva, Rosário Fernandes:
The rank partition and the covering number of the elements of the dual matroid. Ars Comb. 59 (2001) - Omer Berkman, Michal Parnas, Yehuda Roditty:
All Cycles are Edge-Magic. Ars Comb. 59 (2001) - David A. Pike, Nabil Shalaby:
The Use of Sklem Sequences to Generate Perfect One-Factorizations. Ars Comb. 59 (2001) - Masakazu Nihei:
A Note on the Toughness of Certain Graphs. Ars Comb. 59 (2001) - Tao Jiang:
Short Even Cycles In Cages With Odd Girth. Ars Comb. 59 (2001) - Mikhail E. Muzychuk:
On normal quotients of transitive graphs. Ars Comb. 59 (2001) - Anthony Bonato:
Constrained classes closed under unions and ne.c. structures. Ars Comb. 59 (2001) - Bernt Lindström:
Sp-Sets with Multiplier p. Ars Comb. 59 (2001) - Ganesh Sittampalam, A. Donald Keedwell:
Critical sets for dihedral groups. Ars Comb. 59 (2001) - Kuo-Bing Huang, Wen-Chung Huang, Chia-Chin Hung, Guei-Hua Wang:
Some Classes of Extended Meldelsohn Triple Systems and Numbers of Common Blocks. Ars Comb. 59 (2001) - Zhang Cheng-heng:
On The Generalized Fibonacci Matrix of Order 2^k Sequence {G^(2k)n}. Ars Comb. 59 (2001) - Hideo Komuro, Kiyoshi Ando:
Diagonal flips of pseudo triangulations on the sphere. Ars Comb. 59 (2001) - M. H. Armanious:
Subsquags and Normal Subsquags. Ars Comb. 59 (2001) - Klaus Dohmen:
A combinatorial approach to improved Bonferroni inequalities. Ars Comb. 59 (2001) - Yasuhiro Fukuchi:
Edge-Magic Labelings of Petersen Graphs P(n, 2). Ars Comb. 59 (2001) - William L. Kocay, Daniel Neilson, Ryan Szypowski:
Drawing Graphs on the Torus. Ars Comb. 59 (2001) - Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech:
Generalised Ramsey Numbers with respect to Classes of Graphs. Ars Comb. 59 (2001) - Steve Bowser, Charles Cable:
The Niche Category of Dense Graphs. Ars Comb. 59 (2001) - Rumen N. Daskalov:
Some nonexistence results for 7-dimensional ternary linear codes. Ars Comb. 59 (2001) - Mohammad Ghebleh, Ebadollah S. Mahmoodian:
On Uniquely List Colorable Graphs. Ars Comb. 59 (2001)
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 2023-05-28 22:36 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:
