Subsemi-Eulerian graphs
A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian.
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Wiley
1982-01-01
|
| Serier: | International Journal of Mathematics and Mathematical Sciences |
| Fag: | |
| Online adgang: | http://dx.doi.org/10.1155/S0161171282000520 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|