Chinese postman problems

A form of Chinese postman problem — The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.

Meanings

noun
  1. pluralplural of Chinese postman problem
Cite this entry
APA

Chinese postman problems. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Chinese%20postman%20problems

MLA

“Chinese postman problems.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Chinese%20postman%20problems. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Chinese postman problems,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Chinese%20postman%20problems.

Source: Chinese postman problems on Wiktionary, CC BY-SA 4.0.