The following pages link to (Q4633818):
Displaying 19 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Coloring vertices and faces of maps on surfaces (Q708418) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Three-coloring graphs embedded on surfaces with all faces even-sided (Q1898734) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
- Coloring of Triangle-Free Graphs on the Double Torus (Q3629461) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- (Q5206906) (← links)
- (Q5248307) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Coloring parameters for graphs on surfaces (Q5301024) (← links)
- Coloring Triangle-Free Graphs on Surfaces (Q5387740) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
