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!
|
| _version_ | 1832553327261384704 |
|---|---|
| author | Charles Suffel Ralph Tindell Cynthia Hoffman Manachem Mandell |
| author_facet | Charles Suffel Ralph Tindell Cynthia Hoffman Manachem Mandell |
| author_sort | Charles Suffel |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-474a8e28618d4e23a161709ae042186c |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1982-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-474a8e28618d4e23a161709ae042186c2025-02-03T05:54:17ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251982-01-015355356410.1155/S0161171282000520Subsemi-Eulerian graphsCharles Suffel0Ralph Tindell1Cynthia Hoffman2Manachem Mandell3Stevens Institute of Technology, Hoboken 07030, New Jersey, USAStevens Institute of Technology, Hoboken 07030, New Jersey, USACollege of Saint Elizabeth, Convent Station 07961, New Jersey, USABrooklyn College of the City, University of New York, Bedford Ave. and Ave. H, Brooklyn 11210, New York, USAA 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.http://dx.doi.org/10.1155/S0161171282000520spanning walkseulerian graphssub-eulerian graphssemi-eulerian graphs. |
| spellingShingle | Charles Suffel Ralph Tindell Cynthia Hoffman Manachem Mandell Subsemi-Eulerian graphs International Journal of Mathematics and Mathematical Sciences spanning walks eulerian graphs sub-eulerian graphs semi-eulerian graphs. |
| title | Subsemi-Eulerian graphs |
| title_full | Subsemi-Eulerian graphs |
| title_fullStr | Subsemi-Eulerian graphs |
| title_full_unstemmed | Subsemi-Eulerian graphs |
| title_short | Subsemi-Eulerian graphs |
| title_sort | subsemi eulerian graphs |
| topic | spanning walks eulerian graphs sub-eulerian graphs semi-eulerian graphs. |
| url | http://dx.doi.org/10.1155/S0161171282000520 |
| work_keys_str_mv | AT charlessuffel subsemieuleriangraphs AT ralphtindell subsemieuleriangraphs AT cynthiahoffman subsemieuleriangraphs AT manachemmandell subsemieuleriangraphs |