Petra Sparl

According to our database, Petra Sparl authored at least 10 papers between 2004 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

Multicoloring of cannonball graphs.

Petra Sparl, Rafal Witkowski, Janez Zerovnik

Ars Math. Contemp., 2016

2012

A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs.

Petra Sparl, Rafal Witkowski, Janez Zerovnik

Inf. Process. Lett., 2012

Simpler multicoloring of triangle-free hexagonal graphs.

Ignasi Sau, Petra Sparl, Janez Zerovnik

Discret. Math., 2012

1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs.

Petra Sparl, Rafal Witkowski, Janez Zerovnik

Algorithmica, 2012

2010

2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs.

Petra Sparl, Janez Zerovnik

Int. J. Comput. Math., 2010

2007

A note on n-tuple colourings and circular colourings of planar graphs with large odd girth.

Petra Sparl, Janez Zerovnik

Int. J. Comput. Math., 2007

2005

2-local 4/3-competitive algorithm for multicoloring hexagonal graphs.

Petra Sparl, Janez Zerovnik

J. Algorithms, 2005

2-local distributed algorithms for generalized coloring of hexagonal graphs.

Petra Sparl, Janez Zerovnik

Electron. Notes Discret. Math., 2005

2004

2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs.

Petra Sparl, Janez Zerovnik

Inf. Process. Lett., 2004

Homomorphisms of hexagonal graphs to odd cycles.

Petra Sparl, Janez Zerovnik

Discret. Math., 2004