Petra Šparl

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Maximum induced matching of hexagonal graphs	2016-07-11	Paper
Multicoloring of cannonball graphs	2016-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q2943938	2015-09-07	Paper
On the weighted \(k\)-path vertex cover problem	2014-09-08	Paper
1-local 7/5-competitive algorithm for multicoloring hexagonal graphs	2013-04-03	Paper
A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs	2012-07-25	Paper
Simpler multicoloring of triangle-free hexagonal graphs	2012-01-11	Paper
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs	2010-09-14	Paper
Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph	2010-02-05	Paper
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs	2009-07-21	Paper
Circular chromatic number of triangle-free hexagonal graphs	2008-07-29	Paper
Circular chromatic number of triangle-free hexagonal graphs	2008-03-06	Paper
A note onn-tuple colourings and circular colourings of planar graphs with large odd girth	2007-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q5310614	2007-10-11	Paper
2-local distributed algorithms for generalized coloring of hexagonal graphs	2007-05-29	Paper
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	2005-05-04	Paper
Homomorphisms of hexagonal graphs to odd cycles	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4431015	2003-10-13	Paper

Research outcomes over time

This page was built for person: Petra Šparl