3 ms·

edit: Never mind - I hadn't read far enough in. He means 'Eulerian graph', I think. As in a graph with an Eularian trail. You know it might be nice for people t

edit: Never mind - I hadn't read far enough in. He means 'Eulerian graph', I think. As in a graph with an Eularian trail. You know it might be nice for people to get the terminology right if you are writing about this stuff... What do you mean by 'Euler graphs'? As in, the problems described by him such as the bridge problem? I would call anything with vertices and edges an 'Euler graph' as opposed to a 'Cartesian graph' (a chart).

rowyourboat 9y ago
> You know it might be nice for people to get the terminology right if you are writing about this stuff... He specifically mentions in the article that he found both terms and used the one used in the literature he refers to.
- gilleain 9y ago
  Fair point. A minor detail is that he mistypes the standard term : > I used “Euler path” instead of “Eulerean path” just to be consistent with the referenced book [1] definition Should be 'Eulerian'. It's not horribly confusing, just a little vague.
  - vardanator 9y ago
    Fixed, thanks!