Le graphe de «La nuit des rois»
The Number of Functional Digraphs.
A graph theoretic approach to matrix inversion by partitioning.
The forcibly-tree and forcibly-unicyclic degree sequences.
On the Coloring of Signed Graphs.
Class reconstruction numbers of unicyclic graphs
On the genus of an n-connected graph
On the reconstruction of countable forests.
A Maximal Toroidal Graph which is not a Triangulation.
The crossing numbers of some generalized Petersen graphs.
Page 1