Geodesic

Combinatorics and graph theory. Part XIII

Sommaire

Every $3$-connected graph on at least $13$ vertices has a contractible set on $5$ vertices
p. 5-93
On the chromatic numbers of $3$-dimensional slices
p. 94-113
Restriction on minimum degree in the contractible sets problem
p. 114-123
On the reconstruction of graphs of connectivity $2$ having a $2$-vertex set dividing this graph into at least $3$ parts
p. 124-151
On WL-rank and WL-dimension of some Deza dihedrants
p. 152-172
Injective proofs of log concavity for some combinatorial sequences
p. 173-191
On the chromatic numbers of Johnson-type graphs
p. 192-200