Premium
A note on the line‐distinguishing chromatic number and the chromatic index of a graph
Author(s) -
Salvi N. Zagaglia
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170504
Subject(s) - chromatic scale , combinatorics , mathematics , graph , index (typography) , friendship graph , edge coloring , line (geometry) , discrete mathematics , line graph , computer science , graph power , geometry , world wide web
Let λ( G ) be the line‐distinguishing chromatic number and x ′( G ) the chromatic index of a graph G . We prove the relation λ( G ) ≥ x ′( G ), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.