×

zbMATH — the first resource for mathematics

Vertex-distinguishing edge colorings of graphs. (English) Zbl 1008.05067
Summary: We consider lower bounds on the the vertex-distinguishing edge chromatic number of graphs and prove that these are compatible with a conjecture of A. C. Burris and R. H. Schelp [J. Graph Theory 26, 73-82 (1997; Zbl 0886.05068)]. We also find upper bounds on this number for certain regular graphs of low degree and hence verify the conjecture for a reasonably large class of such graphs.

MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] and Irregular assignments and vertex-distinguishing edge-colorings of graphs, Combinatorics 90 ( et al., eds.). Elsevier Science Pub, New York ( 1992), 1-9. · Zbl 0769.05035
[2] Balister, Combin Probab Comput 10 pp 463– (2001)
[3] Balister, Discrete Math 252 pp 17– (2002)
[4] Balister, Balanced edge colorings
[5] Bazgan, J Combin Theory B 75 pp 288– (1999)
[6] Modern graph theory, Graduate Texts in Mathematics, Springer; p. 152-154.
[7] Bollobás, European J Combin 4 pp 311– (1980)
[8] Burris, J Graph Theory 26 pp 70– (1997)
[9] ?er?y, Math Slovaca 46 pp 21– (1996)
[10] Ho?nák, Ars Combin 41 pp 289– (1995)
[11] Ho?nák, Discrete Math 176 pp 139– (1997)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.