Vertex‐distinguishing edge colorings of graphs

descriptionPublicationkeyboard_double_arrow_right Article 17 Dec 2002 English Publisher:WileyJournal:Journal of Graph Theory, volume 42, pages 95-109 (issn: 0364-9024, eissn: 1097-0118,

Copyright policy )

Authors: Paul N. Balister; O. M. Riordan; Richard H. Schelp;

doi: 10.1002/jgt.10076

Vertex‐distinguishing edge colorings of graphs

- Summary
- Subjects
- Metrics

Abstract

AbstractWe consider lower bounds on the the vertex‐distinguishing edge chromatic number of graphs and prove that these are compatible with a conjecture of Burris and Schelp 8. We also find upper bounds on this number for certain regular graphs G of low degree and hence verify the conjecture for a reasonably large class of such graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 95–109, 2003

Related Organizations

University of Cambridge
United Kingdom
University of Memphis
United States

Keywords

Coloring of graphs and hypergraphs, chromatic number, strong coloring, edge coloring

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	62
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average