Eulerian digraphs
Description: Directed graphs in which every vertex has equal indegree and outdegree, allowing an Euler circuit when the graph is connected appropriately.
Primary topic: Advanced Graph Theory Research (46%)
OpenAlex ID: keywords/eulerian-digraphs
