Pages that link to "Item:Q2570123"
From MaRDI portal
The following pages link to A technique for multicoloring triangle-free hexagonal graphs (Q2570123):
Displaying 10 items.
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs (Q2883583) (← links)
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS (Q3063610) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs (Q5747734) (← links)
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5900073) (← links)
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5920353) (← links)