The following pages link to Sparse Graphs Are Near-Bipartite (Q5130577):
Displaying 5 items.
- Sparse halves in dense triangle-free graphs (Q490981) (← links)
- Nearly bipartite graphs (Q1412666) (← links)
- Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
- A density bound for triangle‐free 4‐critical graphs (Q6047637) (← links)
- Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)