Bulletin - Archives

§ Recent Issues §

2023 Vol.18 No.1 No.2 No.3
2022 Vol.17 No.1 No.2 No.3 No.4
2021 Vol.16 No.1 No.2 No.3 No.4
2020 Vol.15 No.1 No.2 No.3 No.4
2019 Vol.14 No.1 No.2 No.3 No.4
2018 Vol.13 No.1 No.2 No.3 No.4
2017 Vol.12 No.1 No.2 No.3 No.4
2016 Vol.11 No.1 No.2 No.3 No.4
2015 Vol.10 No.1 No.2 No.3 No.4
2014 Vol.09 No.1 No.2 No.3 No.4
2013 Vol.08 No.1 No.2 No.3 No.4

§ Online Archives §

Accepted Papers
Author Index
Journal Correction
Back Issues(1973-2005)

New Series (2006~2012)

Archives

Vol. 16 No. 4, 1988 December

Perfect graphs and kernels
C. BERGE and P. DUCHET JAMES R. CLAY p.0
Geometric and combinatorial ideas related to circular planar nearrings
JAMES R. CLAY p.0
On the capacity of write-unidirectional memories
GERARD COHEN p.0
Computer programs for investigating syntactic near-rings of finite group-semiautomata
YUEN FONG (方源) and J. R. CLAY p.0
Extremal problems and the Lagrange function for hypergraphs
P. FRANKL and Z. FUREDI p.0
Some results on ascending subgraph decomposition
HUNG-LIN FU (傅恆霖) p.0 Download PDF
A characterization of some (n,k,d, q )-codes meeting the Griesmer bound for given integers $ k \geq 3$, $q \geq 5$ and $d=q^{k-1}-q^{\alpha}-q^{\beta}-q^{\gamma}$ $(0 \leq \alpha \leq \beta < {\gamma} < {k-1}$ or$ 0 \leq \alpha < \beta \leq {\gamma} < {k-1})$
NOBORU HAMADA and MICHEL DEZA p.0
2-class subschemes of rational G-schemes
HUA-MIN HUANG (黃華民) p.0
Further results on the E-K-R theorem for the distance regular graphs $H_q$ (k,n)
TAYUAN HUANG (黃大原) p.0 Download PDF
Ranks of chordal graphs
KO-WEI LIH (李國偉) p.0 Download PDF
Some results on cyclic UEP codes
MAO-CHAO LIN (林茂昭) p.0 Download PDF
A simple proof for the maximal planar case of Steinitz's theorem
HIROSHI MAEHARA p.0
Graphs which have no finite planar covering
SEIYA NEGAMI p.0
PROBLEM SESSION
p.0