Abstract
AbstractWe prove that every graph of minimum degree at least contains a subdivision of some maximal 3‐degenerate graph of order . This generalizes the classic results of Dirac () and Pelikán (). We conjecture that for any planar maximal 3‐degenerate graph of order , every graph of minimum degree at least contains a subdivision of . We verify this in the case is and .
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
