On the Cutting Edge: Simplified O(n) Planarity by Edge Addition¶
Boyer, J. M., & Myrvold, W. J. (2004). On the Cutting Edge: Simplified O(n) Planarity by Edge Addition: Simplified O(n) Planarity by Edge Addition. Journal of Graph Algorithms and Applications.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Planarity
- To prove a graph planar, he runs a linear-time planarity test that returns either a planar embedding or a Kuratowski subgraph as its certificate, as Boyer and Myrvold's does
This sourceLinear-time methods for planar embedding and for Kuratowski subgraph isolation.
- To prove a graph planar, he runs a linear-time planarity test that returns either a planar embedding or a Kuratowski subgraph as its certificate, as Boyer and Myrvold's does
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
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:b6efb4d92213 · see in the full table