The following pages link to A note on superbrittle graphs (Q1081614):
Displaying 16 items.
- A note on path domination (Q339493) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
- Sum-perfect graphs (Q1735702) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- Quasi-brittle graphs, a new class of perfectly orderable graphs (Q2366016) (← links)
- A New Class of Brittle Graphs (Q3478443) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- A note on strong perfectness of graphs (Q3714102) (← links)
- Walk Domination and HHD-Free Graphs (Q6489357) (← links)
