Abstract
Given four distinct vertices in a 4-connected planar graphG, we characterize when the graphGcontains aK4-subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has noK4-subdivision with specified degree three vertices, if and only if the four specified vertices are contained in a facial cycle in the unique plane embedding of the graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
