Abstract
A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of K4. As a generalization, we ask for the minimum number of K4-subdivisions that are contained in every 3-connected graph on n vertices. We prove that there are Ω(n3) such K4-subdivisions and show that the order of this bound is tight for infinitely many graphs. We further investigate a better bound in dependence on m and prove that the computational complexity of the problem of counting the exact number of K4-subdivisions is #P-hard.
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
