Vermutungen über numerierbare Graphen. (Conjectures on graphs that can be numbered) (Q1074602)

The author investigates rigorous graphs. A finite, undirected, connected, simple graph \(G=(V,E)\) with \(| E| =n\in {\mathbb{N}}\) is rigorous if, and only if, the edges of G can be oriented and distinctly numbered with the integers 1,2,...,n so that at each vertex the sum of the numbers on the inwardly directed edges equals that on the outwardly directed edges. The term ''rigorous graph'' is a generalization of the concept ''current graph'', introduced by the author in his book with the title ''Map color theorem'' (1974; Zbl 0287.05102). As is well-known the current graph plays an important role in the proof of Heawood's color problem on surfaces of the genus \(p\in {\mathbb{N}}\) and in the proof of the solution of Heawood's empire problem in the plane. Since the whole class of rigorous graphs is unknown, the author determines several classes of rigorous graphs, including \(K_ n\) (n\(\geq 4)\), and \(K_{2n,2m}\) for m,n\(\geq 2\) and gives some interesting conjectures on rigorous graphs. It is very interesting to compare this paper with the investigations of \textit{D. W. Bange}, \textit{A. E. Barkauskas} and \textit{P. J. Slater} dealing with conservative graphs published in J. Graph Theory 4, 81-91 (1980; Zbl 0401.05066).