Graph Theory with Applications to Engineering and Computer Science¶
Deo, N. (1974). Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Planarity
- In practice, planarity is the binding constraint in single-layer printed-circuit-board routing — a circuit layout requires no via stitching precisely when the connection graph is planar
This sourcePresents printed-circuit-board layout as a planarity question, whether the connections can be made without an extra insulation layer, with graph thickness counting the layers needed. Poses the three-utilities problem in Chapter 1, connecting houses to each of the three utilities (water, gas and electricity; Figs. 1-6 and 1-7), and returns to 'the puzzle of three utilities, posed in Chapter 1' beside printed-circuit layout (Internet Archive full-text search snippets).
Supported in partVerified against the source
- In practice, planarity is the binding constraint in single-layer printed-circuit-board routing — a circuit layout requires no via stitching precisely when the connection graph is planar
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:bd0a4d721f0f · see in the full table