Pages that link to "Item:Q2390258"

The following pages link to 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258):

Displaying 14 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)
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice (Q1349081) (← links)
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
• A technique for multicoloring triangle-free hexagonal graphs (Q2570123) (← links)
• \(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs (Q2883583) (← links)
• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs (Q3005572) (← links)
• 2-local distributed algorithms for generalized coloring of hexagonal graphs (Q3439359) (← links)
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs (Q3608876) (← links)
• Experimental and Efficient Algorithms (Q5710015) (← 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)