Hervé Hocquard

	2011
7		Hervé Hocquard, Petru Valicov: Strong edge colouring of subcubic graphs. Discrete Applied Mathematics 159(15): 1650-1657 (2011)
6		Hervé Hocquard, Mickaël Montassier: Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Electronic Notes in Discrete Mathematics 38: 457-462 (2011)
5		Hervé Hocquard, Pascal Ochem, Petru Valicov: Bounds and complexity results for strong edge colouring of subcubic graphs. Electronic Notes in Discrete Mathematics 38: 463-468 (2011)
4		Hervé Hocquard: Graphs with maximum degree 6 are acyclically 11-colorable. Inf. Process. Lett. 111(15): 748-753 (2011)
	2010
3		Hervé Hocquard, Mickaël Montassier, André Raspaud: A note on the acyclic 3-choosability of some planar graphs. Discrete Applied Mathematics 158(10): 1104-1110 (2010)
	2009
2		Hervé Hocquard, Mickaël Montassier: Acyclic choosability of planar graphs: a Steinberg like approach. Electronic Notes in Discrete Mathematics 34: 199-205 (2009)
1		Hervé Hocquard, Mickaël Montassier: Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Inf. Process. Lett. 109(21-22): 1193-1196 (2009)

Coauthor Index

1	Mickaël Montassier	[1] [2] [3] [6]
2	Pascal Ochem	[5]
3	André Raspaud	[3]
4	Petru Valicov	[5] [7]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page