### Abstract

It is shown that a connected graph G spans an eulerian graph if and only if G is not spanned by an odd complete bigraph K(2_{m} + 1, 2n + 1). A disconnected graph spans an eulerian graph if and only if it is not the union of the trivial graph with a complete graph of odd order. Exact formulas are obtained for the number of lines which must be added to such graphs in order to get eulerian graphs.

Original language | English (US) |
---|---|

Pages (from-to) | 79-84 |

Number of pages | 6 |

Journal | Journal of Graph Theory |

Volume | 1 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 1977 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Geometry and Topology

### Cite this

*Journal of Graph Theory*,

*1*(1), 79-84. https://doi.org/10.1002/jgt.3190010115

}

*Journal of Graph Theory*, vol. 1, no. 1, pp. 79-84. https://doi.org/10.1002/jgt.3190010115

**The spanning subgraphs of eulerian graphs.** / Boesch, F. T.; Suffel, Charles; Tindell, R.

Research output: Contribution to journal › Article

TY - JOUR

T1 - The spanning subgraphs of eulerian graphs

AU - Boesch, F. T.

AU - Suffel, Charles

AU - Tindell, R.

PY - 1977/1/1

Y1 - 1977/1/1

N2 - It is shown that a connected graph G spans an eulerian graph if and only if G is not spanned by an odd complete bigraph K(2m + 1, 2n + 1). A disconnected graph spans an eulerian graph if and only if it is not the union of the trivial graph with a complete graph of odd order. Exact formulas are obtained for the number of lines which must be added to such graphs in order to get eulerian graphs.

AB - It is shown that a connected graph G spans an eulerian graph if and only if G is not spanned by an odd complete bigraph K(2m + 1, 2n + 1). A disconnected graph spans an eulerian graph if and only if it is not the union of the trivial graph with a complete graph of odd order. Exact formulas are obtained for the number of lines which must be added to such graphs in order to get eulerian graphs.

UR - http://www.scopus.com/inward/record.url?scp=85014231964&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014231964&partnerID=8YFLogxK

U2 - https://doi.org/10.1002/jgt.3190010115

DO - https://doi.org/10.1002/jgt.3190010115

M3 - Article

VL - 1

SP - 79

EP - 84

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -