Graphs on Surfaces¶
Mohar, B., & Thomassen, C. (2001). Graphs on Surfaces. Johns Hopkins University Press.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Embeddability
- When a graph fails — say a complete graph on five nodes — the remediation triangle names the only structural moves: delete an edge (weaken the substrate), move to a surface of higher genus such as the torus (enrich the ambient), or permit a bounded number of crossings (weaken the conflict predicate).
This sourceTreats higher-genus embeddings and the genus hierarchy — the remediation of moving a non-planar graph to a surface of higher genus (e.g., the torus) or permitting bounded crossings.
- When a graph fails — say a complete graph on five nodes — the remediation triangle names the only structural moves: delete an edge (weaken the substrate), move to a surface of higher genus such as the torus (enrich the ambient), or permit a bounded number of crossings (weaken the conflict predicate).
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:cc739efcf3c8 · see in the full table