traversable graph A graph that can be drawn without removing pen from paper or going over the same edge twice. Euler showed that a graph is traversable if and only if it has 0 or 2 vertices with odd degree. See Eulerian graph, Eulerian trail.
traversable graph
数学辞典收录了4151条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。