The following pages link to Petra Šparl (Q658034):
Displaying 19 items.
- (Q406315) (redirect page) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← 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)
- Multicoloring of cannonball graphs (Q2810379) (← links)
- (Q2943938) (← links)
- (Q3400664) (← links)
- 2-local distributed algorithms for generalized coloring of hexagonal graphs (Q3439359) (← links)
- (Q3515284) (← links)
- (Q4431015) (← links)
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs (Q4675487) (← links)
- (Q5310614) (← links)
- A note on<i>n</i>-tuple colourings and circular colourings of planar graphs with large odd girth (Q5431618) (← links)
- (Q5446947) (← links)
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs (Q5747734) (← links)
