The following pages link to Fragmentability of graphs (Q1850531):
Displaying 15 items.
- Percolation with small clusters on random graphs (Q293653) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- Improved upper bounds for planarization and series-parallelization of degree-bounded graphs (Q426901) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- A note on the bounded fragmentation property and its applications in network reliability (Q1413235) (← links)
- A note on fragile graphs (Q1598838) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Research problems from the 18th British Combinatorial Conference (Q1810663) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Representation of fragmentary structures by oriented graphs (Q2320265) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- Dismantling Sparse Random Graphs (Q3512603) (← links)
- Induced Forests in Regular Graphs with Large Girth (Q3545905) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- Achromatic and Harmonious Colorings of Circulant Graphs (Q4604012) (← links)
