Mario Stefanutti
Reputation
462
Next tag badge:
17/100 score
1/20 answers
Badges
3 11
Newest
Impact
~45k people reached

• 0 posts edited
• 0 helpful flags
• 25 votes cast

65 Actions

 1d accepted How to create some large 3-regular planar graphs 1d asked How to create some large 3-regular planar graphs Dec 22 awarded Caucus Dec 14 awarded Yearling Aug 28 awarded Tumbleweed Aug 25 answered Find if it is possible to draw a closed (cycle; not a path) continuous line… Aug 22 comment Find if it is possible to draw a closed (cycle; not a path) continuous line… I am not really sure to have understood the question, but if I did ... if you have two neighbours vertices with an odd number of edges it is impossible what you are asking. This is because if the path passes through a vertex walking on two of its edges the only way to pass also on the third one would be if that edge is the last one of the entire path. Moreover since you are looking for a cycle the same reasoning can be done with just one vertex Jul 17 awarded Popular Question Jul 2 awarded Curious Jun 10 awarded Nice Answer Apr 16 awarded Yearling Mar 25 answered What are the best websites for learning math? Mar 8 awarded Necromancer Jan 31 comment Help with distribution and disposition of faces in a map (four color theorem) The "far far away land" it is full also of F4 faces (squares) :-) Nice category of graphs, thanks! Jan 29 revised Question about 3-regular graphs with a restriction (also fullerene and four color theorem) added 162 characters in body Jan 28 revised Question about 3-regular graphs with a restriction (also fullerene and four color theorem) added 262 characters in body Jan 26 revised Question about 3-regular graphs with a restriction (also fullerene and four color theorem) Corrected a type error Jan 25 comment Question about 3-regular graphs with a restriction (also fullerene and four color theorem) With 17 and 19 faces for sure fullerene exist: hog.grinvin.org/Fullerenes Jan 25 comment Question about 3-regular graphs with a restriction (also fullerene and four color theorem) I did a quick check but for now the sequence 1,0,1,1,3 has 252 match. I suppose still too few elements! Jan 25 asked Question about 3-regular graphs with a restriction (also fullerene and four color theorem)