Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths

DOI10.1016/0012-365X(78)90149-8zbMath0376.05029MaRDI QIDQ1245843

Kenneth A. Berman

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Three-colourings of planar 4-valent maps ⋮ Hamilton cycles in tensor product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 1-Factors of Oriented Graphs
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths