Pages that link to "Item:Q1349081"
From MaRDI portal
The following pages link to Finding a five bicolouring of a triangle-free subgraph of the triangular lattice (Q1349081):
Displaying 11 items.
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Homomorphisms of hexagonal graphs to odd cycles (Q1827797) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258) (← links)
- A technique for multicoloring triangle-free hexagonal graphs (Q2570123) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS (Q3063610) (← links)
- 2-local distributed algorithms for generalized coloring of hexagonal graphs (Q3439359) (← links)
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs (Q5747734) (← links)
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice (Q5936032) (← links)
