The firefighter number conjecture for planar graphs of girth at least 5
The firefighter number conjecture for planar graphs of girth at least 5
Let be the class of planar graphs of girth at least , and let denote its firefighter number. Firefighter number conjecture for planar graphs of girth at least 5.
The paper explains that this would be stronger than the known result and suggests adapting its proof techniques to the girth- case, but the conjecture remains open.
Sources & referencesView supporting material
Primary source
Louis Esperet, Jan van den Heuvel, Frédéric Maffray and Félix Sipma, “Fire Containment in Planar Graphs”, arXiv:1102.3016 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.