The following pages link to (Q4633932):
Displaying 12 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)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← links)
- Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487) (← links)
- Sub-exponentially many 3-colorings of triangle-free planar graphs (Q2851443) (← links)
- Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time (Q5236218) (← links)
