The following pages link to (Q4633932):
Displaying 7 items.
- Finding disjoint paths in split graphs (Q493652) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
