Subsemi-Eulerian graphs

Charles Suffel, Ralph Tindell, Cynthia Hoffman and Manachem Mandell

International Journal of Mathematics and Mathematical Sciences, 1982, vol. 5, 1-12

Abstract:

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.

In this paper, we consider the related notion of a subsemi-eulerian graph, i.e. a graph which is spanned by a supergraph having an open trail containing all of its lines. The subsemi-eulerian graphs are characterized and formulas for the minimum number of required additional lines are given. Interrelationships between the two problems are stressed as well.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/5/165045.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/5/165045.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:165045

DOI: 10.1155/S0161171282000520

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().