Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five

Hervé Hocquard; Mickaël Montassier

doi:10.1016/j.endm.2011.09.074

Journal Articles Electronic Notes in Discrete Mathematics Year : 2011

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five

(1) , (1)

1

Hervé Hocquard

Function : Author
PersonId : 183874
IdHAL : herve-hocquard
ORCID : 0000-0001-8194-4684

Laboratoire Bordelais de Recherche en Informatique

Mickaël Montassier

Function : Author
PersonId : 7097
IdHAL : mickael-montassier
IdRef : 105605115

Laboratoire Bordelais de Recherche en Informatique

CV

Keywords

Vertex-distinguishing edge coloring Maximum average degree Edge coloring

Domains

Discrete Mathematics [cs.DM]

Mickael Montassier : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01264287

Submitted on : Friday, January 29, 2016-10:21:34 AM

Last modification on : Friday, March 24, 2023-2:53:01 PM

Dates and versions

lirmm-01264287 , version 1 (29-01-2016)

Identifiers

HAL Id : lirmm-01264287 , version 1
DOI : 10.1016/j.endm.2011.09.074

Cite

Hervé Hocquard, Mickaël Montassier. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Electronic Notes in Discrete Mathematics, 2011, 38, pp.457-462. ⟨10.1016/j.endm.2011.09.074⟩. ⟨lirmm-01264287⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS LIRMM TDS-MACS

62 View

0 Download

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share