|
|
|
|
|
Mikhail B. Abrosimov,Peter V. Razumovsky
Pág. 1 - 7
The article describes the results of the search for a minimal vertex and edge extensions of an undirected colored star graphs. This search is a part of the minimal extensions of a colored graphs problem research. A graph G* is called a vertex (edge) k-ex...
ver más
|
|
|
|
|