Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2005

[Date Index] [Thread Index] [Author Index]

Search the Archive

EulerianCycle in graphs

  • To: mathgroup at smc.vnet.net
  • Subject: [mg54276] EulerianCycle in graphs
  • From: Steve Gray <stevebg at adelphia.net>
  • Date: Wed, 16 Feb 2005 14:35:56 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

   If I do Length[EulerianCycle[CompleteGraph[24,24]]], I get the correct answer (577) in about 1-2
seconds, and ShowGraph[CompleteGraph[24,24],EdgeStyle?Thin] also works, so everything looks ok.
 
   But I have a graph "comgraph" with 40 vertices and 66 edges. All vertices are of even order,
either 2 or 4. However the function EulerianCycle[comgraph] never terminates, even after an hour. 

   Are there restrictions on graphs that make EulerianCycle work properly? Or could something else
be wrong? I can supply details of comgraph if it would help. 

   This is seriously holding me up. Thank you for any help.

Steve Gray


  • Prev by Date: Re: Is the answer for this Integral correct???
  • Next by Date: EulerianCycle in graphs
  • Previous by thread: Re: Re: Apply on MultipleListPlot using pure functions
  • Next by thread: EulerianCycle in graphs