Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the concept of bounded queue-number in planar graphs through this 22-minute IEEE conference talk. Delve into the history of queue-number theory, examine various extensions, and understand HD compositions and H petitions as they relate to planar graphs. Gain insights from experts Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood as they present their findings and conclude with the implications of this research in graph theory.
