Skip to main content
SpringerLink
Log in

Adjacent vertex distinguishing edge coloring of IC-planar graphs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The adjacent vertex distinguishing edge coloring of a graph G is a proper edge coloring in which each pair of adjacent vertices is assigned different color sets. The smallest number of colors for which G has such a coloring is denoted by \(\chi '_a(G)\). An important conjecture due to Zhang et al. (Appl Math Lett 15:623–626, 2002) asserts that \(\chi '_a(G)\le \Delta (G)+2\) for any connected graph G with order at least 6. By applying the discharging method, we show that this conjecture is true for any IC-planar graph G with \(\Delta (G)\ge 16\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Albertson MO (2008) Chromatic number, independence ratio, and crossing number. ARS Math Contemp 1:1–6

    Article  MathSciNet  Google Scholar 

  • Bonamy M, Bousquet N, Hocquard H (2013) Adjacent vertex-distinguishing edge colorings of graphs. EuroComb 16:313–318

    MathSciNet  MATH  Google Scholar 

  • Balister PN, Györi E, Lehel J, Schelp RH (2007) Adjacent vertex distinguishing edge-colorings. SIAM J Discrete Math 21(1):237–250

    Article  MathSciNet  Google Scholar 

  • Bondy JA, Murty USR (1976) Graph theory with applications. North-Holland, New York

    Book  Google Scholar 

  • Horňák M, Huang DJ, Wang WF (2014) On neighbor-distinguishing index of planar graphs. J Graph Theory 76(4):262–278

    Article  MathSciNet  Google Scholar 

  • Wang WF, Huang DJ (2015) A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree. SIAM J Discrete Math 29(4):2412–2431

    Article  MathSciNet  Google Scholar 

  • Yan CC, Huang DJ, Wang WF (2012) Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four. J Math Study 45(4):331–341

    MathSciNet  MATH  Google Scholar 

  • Zhang ZF, Liu LZ, Wang JF (2002) Adjacent strong edge coloring of graphs. Appl Math Lett 15:623–626

    Article  MathSciNet  Google Scholar 

  • Zhang X, Wu JL (2011) On edge colorings of 1-planar graphs. Inf Process Lett 111:124–128

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (12071260, 12001154), and the Natural Science Foundation of Hebei Province(A2021202025).

Author information

Authors and Affiliations

  1. School of Science, Hebei University of Technology, Tianjin, 300401, China

    Zhuoya Liu & Changqing Xu

Authors
  1. Zhuoya Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changqing Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changqing Xu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Z., Xu, C. Adjacent vertex distinguishing edge coloring of IC-planar graphs. J Comb Optim 43, 710–726 (2022). https://doi.org/10.1007/s10878-021-00807-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-021-00807-0

Keywords

Search

Navigation