Skip to Content

1 Result Found

  • Article
  • Open Access
626 Views
15 Pages

9 April 2026

Following Bauer’s 1985 question on how a graph’s minimum degree relates to it being supereulerian, Catlin solved the problem for graphs with a minimum degree of at least n5. Subsequently, Lai solved it for the case where the minimum degre...