![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Ars Combinatoria, Volume 43
Volume 43, August 1996
- Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura:
A solution of Dudeney's round table problem for p^eq^f + 1. Ars Comb. 43 (1996) - Sanpei Kageyama, Ying Miao:
Some constructions of semiframes. Ars Comb. 43 (1996) - Lin Ke-Rong, Rong-si Chen:
K-coverable polyhex graphs. Ars Comb. 43 (1996) - T. Gangopadhyay:
On the existence of a stable complementing permutation in t-sc graph. Ars Comb. 43 (1996) - Chen Kejun, Zhu Lie:
On the existence of skew room frames of type t^u. Ars Comb. 43 (1996) - Ulrich Teschner:
The bondage number of a graph G can be much greater than Delta(G). Ars Comb. 43 (1996) - S. Arumugam, A. Thuraiswamy:
Total domination in graphs. Ars Comb. 43 (1996) - M. C. Soper:
A semigroup operation using powers of two. Ars Comb. 43 (1996) - Zeng Min Song, Ke Min Zhang:
A new idea for Hamiltonian problem. Ars Comb. 43 (1996) - Kathrin Klamroth, Ingrid Mengersen:
Ramsey numbers of K3 versus (p, q)-graphs. Ars Comb. 43 (1996) - Esther R. Lamken:
A few more partitioned balanced tournament designs. Ars Comb. 43 (1996) - John T. Thorpe, Frederick C. Harris Jr.:
A parallel Stochastic optimization algorithm for finding mappings of the rectilinear minimal crossing problem. Ars Comb. 43 (1996) - Johann Hagauer, Sandi Klavzar:
On independence numbers of the cartesian product of graphs. Ars Comb. 43 (1996) - Huaitang Chen, Kejie Ma, Huishan Zhou:
The ascending star subgraph decomposition of some star forests. Ars Comb. 43 (1996) - Margaret B. Cozzens, Shu-Shih Y. Wu:
Vertex-neighbor-integrity of trees. Ars Comb. 43 (1996) - Odile Favaron, Christina M. Mynhardt:
On the sizes of least common multiples of several pairs of graphs. Ars Comb. 43 (1996) - Oleg V. Borodin:
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs. Ars Comb. 43 (1996) - Ludovít Niepel, Martin Knor, Lubomír Soltés:
Distances in iterated line graphs. Ars Comb. 43 (1996) - Antoni Marczyk:
Hamiltonian cycles in the square of two-connected graph with given circumference. Ars Comb. 43 (1996) - Abdollah Khodkar:
The fine structure of (v, 3) directed triple systems: v = 0 or 1 (mod 3). Ars Comb. 43 (1996) - Hajo Broersma, Xueliang Li:
The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43 (1996) - Qing-Xue Huang:
Complete m-partite decompositions of complete multigraphs. Ars Comb. 43 (1996) - Ernest J. Cockayne, Christina M. Mynhardt:
On a generalization of signed dominating functions of graphs. Ars Comb. 43 (1996) - Martin Knor:
Characterization of minor-closed pseudosurfaces. Ars Comb. 43 (1996) - Jinjiang Yuan:
Path-width and tree-width of the join of graphs. Ars Comb. 43 (1996) - Michael A. Henning:
Domination in regular graphs. Ars Comb. 43 (1996) - Carlos Guia, Oscar Ordaz:
Chvatal-Erdos condition for Hamiltonicity in digraphs. Ars Comb. 43 (1996)
![](https://dblp.uni-trier.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.