Powers of planar graphs, product structure, and blocking partitions

HIGHLIGHTS

• What: The authors show that every G has a 2-blocking partition with parts of size bounded by a function of ∆(G) and tw(G). The authors show that 4-regular graphs do not have ℓ-blocking partitions with bounded size parts. The aim is to minimise t, where minimising c is a secondary goal. The authors show that bounded maximum degree is necessary but not sufficient, and that bounded maximum degree and bounded treewidth are sufficient.
• Who: Marc Distel and collaborators from the (UNIVERSITY) have published the paper: Powers of planar graphs, product structure, and . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.