If a connected graph has a Euler circuit then this implies that all the vertices of the graph have even degree. Is the converse of this argument true? i.e. If a connected graph only contains vertices of even degree does this imply it contains an Euler Circuit?(adsbygoogle = window.adsbygoogle || []).push({});

Could somebody please show me a proof (or counter-proof) of the above statement or at least direct me to a website that contains such a proof?

Thanks.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Euler Circuits

Loading...

Similar Threads for Euler Circuits | Date |
---|---|

Euler Representation of complex numbers | Jan 8, 2016 |

Euler's identity, mathematical beauty and applications of it | Mar 15, 2015 |

Diagonalization of 8x8 matrix with Euler angles | May 18, 2014 |

Zeta(3) and Euler's formula | Jun 11, 2013 |

Eigenvectors of LC-circuit | Aug 19, 2010 |

**Physics Forums - The Fusion of Science and Community**