Pages that link to "Item:Q2346581"

The following pages link to The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581):

Displaying 9 items.

• The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
• On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
• The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
• The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
• On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
• Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
• On the monophonic rank of a graph (Q6045452) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)