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.
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1982-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171282000520 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|