Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ

Hervé Hocquard () and Mickaël Montassier
Additional contact information
Hervé Hocquard: Université Bordeaux I
Mickaël Montassier: Université Bordeaux I

Journal of Combinatorial Optimization, 2013, vol. 26, issue 1, No 12, 152-160

Abstract: Abstract An adjacent vertex-distinguishing edge coloring, or avd-coloring, of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let $\operatorname {mad}(G)$ and Δ(G) denote the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove that every graph G with Δ(G)≥5 and $\operatorname{mad}(G)

Keywords: Adjacent vertex-distinguishing edge coloring; Maximum average degree (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9444-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-011-9444-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9444-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().