Skip to main content
Log in

Every graph is (2,3)-choosable

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

A total weighting of a graph G is a mapping ϕ that assigns to each element zV (G)∪E(G) a weight ϕ(z). A total weighting ϕ is proper if for any two adjacent vertices u and v, ∑ eE(u) ϕ(e)+ϕ(u)≠∑ eE(v) ϕ(e)+ϕ(v). This paper proves that if each edge e is given a set L(e) of 3 permissible weights, and each vertex v is given a set L(v) of 2 permissible weights, then G has a proper total weighting ϕ with ϕ(z) ∈ L(z) for each element zV (G)∪E(G).

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

Access this article

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

  1. L. Addario-Berry, R. E. L. Aldred, K. Dalal and B. A. Reed: Vertex colouring edge partitions, J. Combin. Theory Ser. B 94 (2005), 237–244.

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Addario-Berry, K. Dalal, C. McDiarmid, B. A. Reed and A. Thomason: Vertex-colouring edge-weightings, Combinatorica 27 (2007), 1–12.

    Article  MathSciNet  MATH  Google Scholar 

  3. N. Alon: Combinatorial Nullstellensatz, Combin. Prob. Comput. 8 (1999), 7–29.

    Article  MathSciNet  MATH  Google Scholar 

  4. N. Alon and M. Tarsi: A nowhere zero point in linear mappings, Combinatorica 9 (1989), 393–395.

    Article  MathSciNet  MATH  Google Scholar 

  5. N. Alon and M. Tarsi: Colorings and orientations of graphs, Combinatorica 12 (1992), 125–134.

    Article  MathSciNet  MATH  Google Scholar 

  6. T. Bartnicki, J. Grytczuk and S. Niwczyk: Weight choosability of graphs, J. Graph Theory 60 (2009), 242–256.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. Karoński, T. Luczak and A. Thomason: Edge weights and vertex colours, J. Combin. Theory Ser. B 91 (2004), 151–157.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Kalkowski: On 1,2-conjecture, manuscript, 20–8.

  9. M. Kalkowski, M. Karoński and F. Pfender: Vertex-coloring edge-weightings: towards the 1-2-3- Conjecture, J. Combin. Theory Ser. B 100 (2010), 347–349.

    Article  MathSciNet  MATH  Google Scholar 

  10. J. Przybyło and M. Woźniak: On a 1-2 conjecture, Discrete Mathematics and Theoretical Computer Science 12 (2010), 101–108.

    MathSciNet  MATH  Google Scholar 

  11. J. Przybyło and M. Woźniak: Total weight choosability of graphs, Electronic J. Combinatorics 18 (2011), no. 1, Paper #P112.

    MathSciNet  MATH  Google Scholar 

  12. T. Wang and Q. L. Yu: A note on vertex-coloring 13-edge-weighting, Frontier Math. 4 in China 3 (2008), 1–7.

    Article  Google Scholar 

  13. T. Wong, J. Wu and X. Zhu: Total weight choosability of Cartesian product of graphs, European J. Combinatorics 33 (2012), 1725–1738.

    Article  MathSciNet  MATH  Google Scholar 

  14. T. Wong, D. Yang and X. Zhu: List total weighting of graphs, in: Fete of combinatorics and computer science, 337–353. Bolyai Soc. Math. Stud., 20, János Bolyai Math. Soc., Budapest, 2010.

    Chapter  Google Scholar 

  15. T. Wong and X. Zhu: Total weight choosability of graphs, J. Graph Theory 66 (2011), 198–212.

    Article  MathSciNet  MATH  Google Scholar 

  16. T. Wong and X. Zhu: Permanent index of matrices associated with graphs, manuscript.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuding Zhu.

Additional information

Grant numbers: NSC102-2115-M-110-006-MY2.

Grant numbers: NSF11171310 and ZJNSF Z6110786.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wong, TL., Zhu, X. Every graph is (2,3)-choosable. Combinatorica 36, 121–127 (2016). https://doi.org/10.1007/s00493-014-3057-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-014-3057-8

Mathematics Subject Classification (2000)

Navigation