Pages that link to "Item:Q2390258"
From MaRDI portal
The following pages link to 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258):
Displaying 8 items.
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← 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)
- 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)
