Geodesic

Combinatorics and graph theory. Part IX

Sommaire

On the relationship between multiplicities of the matrix spectrum and signs of components of its eigenvector in a~tree-like structure
p. 5-25
Decomposition of a~$2$-connected graph into three connected subgraphs
p. 26-47
For which graphs sages can guess a~color of at least one hat
p. 48-76
Counting unlabelled chord diagrams of maximal genus
p. 77-87
Framings of spatial graphs
p. 88-94
On critically $3$-connected graphs with exactly two vertices of degree~3. Part~1
p. 95-111
A bound on the number of leaves in a~spanning tree of a~connected graph of minimal degree~6
p. 112-131
Tur\'an type results for distance graphs in infinitesimal plane layer
p. 132-168