Chapter
Chapter 2. Crossing-free subgraphs
pp.：
21 – 25
Chapter 3. A note on the number of 4-circuits in a tournament
pp.：
25 – 33
Chapter 4. On graphs which contain all sparse graphs
pp.：
33 – 39
Chapter 5. Representation of group elements as short products
pp.：
39 – 43
Chapter 6. Some common properties for regularizable graphs, edgecritical graphs and B-graphs
pp.：
43 – 57
Chapter 7. Skew Hadamard matrices of order 16
pp.：
57 – 61
Chapter 8. Sur un problème combinatoire d’antennes en radioastronomie II
pp.：
61 – 67
Chapter 9. Un algorithme de construction des idempotents primitifs d’ideaux d’algèbres sur Fq
pp.：
67 – 77
Chapter 10. Kotzig factorizations: existence and computational results
pp.：
77 – 91
Chapter 11. Character strings as directed Euler paths
pp.：
91 – 99
Chapter 12. On maximal equidistant permutation arrays
pp.：
99 – 107
Chapter 13. Domino squares
pp.：
107 – 125
Chapter 14. Some problems on additive number theory
pp.：
125 – 129
Chapter 15. On almost bipartite large chromatic graphs
pp.：
129 – 137
Chapter 16. Covering graphs by equivalence relations
pp.：
137 – 141
Chapter 17. Analogues for tilings of Kotzig’s theorem on minimal weights of edges
pp.：
141 – 153
Chapter 18. Sets of integers whose subsets have distinct sums
pp.：
153 – 167
Chapter 19. Analogues of the Shannon capacity of a graph
pp.：
167 – 181
Chapter 20. On partially resolvable t- partitions
pp.：
181 – 197
Chapter 21. Decompositions of complete graphs defined by quasigroups
pp.：
197 – 205
Chapter 22. Regular perfect systems of difference sets of size 4 and extremal systems of size 3
pp.：
205 – 215
Chapter 23. A note on one-factorizations having a prescribed number of edges in common
pp.：
215 – 223
Chapter 24. Systemes de transition et coloriages eulériens
pp.：
223 – 235
Chapter 25. Regular and strongly regular selfcomplementary graphs
pp.：
235 – 251
Chapter 26. Construction of additive sequences of permutations of arbitrary lengths
pp.：
251 – 255
Chapter 27.Counting rooted triangulations
pp.：
255 – 267
Chapter 28. Non-Hamiltonian simple planar graphs
pp.：
267 – 277
Annals of Discrete Mathematics Previous Volumes in this Series
pp.：
277 – 278
Theory and Practice of Combinatorics
( Volume 12 )
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
