![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Ars Combinatoria, Volume 46
Volume 46, August 1997
- Mark Ramras:
Fundamental Subsets of Edges of Hypercubes. Ars Comb. 46 (1997) - Ulrich Teschner:
On the bondage number of block graphs. Ars Comb. 46 (1997) - Rainer Bodendiek, G. Walther:
(a, d)-Antimagic Parachutes II. Ars Comb. 46 (1997) - Peter Horák, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas:
Counting frequencies of configurations in Steiner Triple Systems. Ars Comb. 46 (1997) - Josef Lauri:
Pseudosimilarity in Graphs - A Survey. Ars Comb. 46 (1997) - Manoel Lemos:
Non-binary matroids having four non-binary elements. Ars Comb. 46 (1997) - Lowell W. Beineke, Wayne Goddard, Marc J. Lipman:
Graphs with Maximum Edge-Integrity. Ars Comb. 46 (1997) - Lane H. Clark, Thomas Dale Porter:
On the Maximum Number of Chords in a Cycle of a Graph. Ars Comb. 46 (1997) - Ralph Gordon Stanton:
Ryser Designs. Ars Comb. 46 (1997) - Timothy R. Walsh:
Worst-Case Analysis of Read's Chromatic Polynomial Algorithm. Ars Comb. 46 (1997) - A. Antonysamy, G. Arumugam, C. Xavier:
An Algorithm To Find The Core Of A CV-Graph. Ars Comb. 46 (1997) - Peter Danziger:
Uniform Restricted Resolvable Designs with r = 3. Ars Comb. 46 (1997) - Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba:
On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997) - Marialuisa J. de Resmini:
On the classical semitranslation plane of order 16. Ars Comb. 46 (1997) - Bert Randerath, Lutz Volkmann:
Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46 (1997) - Michael O. Albertson:
The Irregularity of a Graph. Ars Comb. 46 (1997) - Guantao Chen, Yiping Liu:
Hamiltonian Graphs with Large Neighborhood Unions. Ars Comb. 46 (1997) - Ramjee P. Swaminathan:
On a Class of Graphic Matrices. Ars Comb. 46 (1997) - Xuding Zhu:
A note on graph reconstruction. Ars Comb. 46 (1997) - R. Yilmaz, Ibrahim Cahit:
E-cordial Graphs. Ars Comb. 46 (1997) - Dragos M. Cvetkovic:
A graph theoretical procedure for clustering binary vectors. Ars Comb. 46 (1997) - Thomas Niessen:
A Fan-Type Result for Regular Factors. Ars Comb. 46 (1997) - Charles Vanden Eynden:
Decomposition of Complete Bipartite Graphs. Ars Comb. 46 (1997) - Alfred Geroldinger, Rudolf Schneider:
On Minimal Zero Sequences With Large Cross Number. Ars Comb. 46 (1997) - Kiyoshi Ando, Hideo Komuro:
The seven graphs whose H-transformations are uniquely determined. Ars Comb. 46 (1997)
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.