The following pages link to A note on fragile graphs (Q1598838):
Displaying 14 items.
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- Non-separable detachments of graphs (Q1403909) (← links)
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam (Q1814095) (← links)
- Fragmentability of graphs (Q1850531) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- A New Class of Brittle Graphs (Q3478443) (← links)
- Color-critical graphs with independent cutset (Q3804719) (← links)
- Some results concerning the ends of minimal cuts of simple graphs (Q4522469) (← links)
- Fragile graphs with small independent cuts (Q4798123) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)
