Abstract
We prove that the maximum degree Δnof a random series-parallel graph withnvertices satisfies Δn/logn→cin probability, andΔn~clognfor a computable constantc> 0. The same kind of result holds for 2-connected series-parallel graphs, for outerplanar graphs, and for 2-connected outerplanar graphs.
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
