Abstract
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.