Skip to main content
×
×
Home

Distance Colouring Without One Cycle Length

  • ROSS J. KANG (a1) and FRANÇOIS PIROT (a2)
Abstract

We consider distance colourings in graphs of maximum degree at most d and how excluding one fixed cycle of length ℓ affects the number of colours required as d → ∞. For vertex-colouring and t ⩾ 1, if any two distinct vertices connected by a path of at most t edges are required to be coloured differently, then a reduction by a logarithmic (in d) factor against the trivial bound O(dt ) can be obtained by excluding an odd cycle length ℓ ⩾ 3t if t is odd or by excluding an even cycle length ℓ ⩾ 2t + 2. For edge-colouring and t ⩾ 2, if any two distinct edges connected by a path of fewer than t edges are required to be coloured differently, then excluding an even cycle length ℓ ⩾ 2t is sufficient for a logarithmic factor reduction. For t ⩾ 2, neither of the above statements are possible for other parity combinations of ℓ and t. These results can be considered extensions of results due to Johansson (1996) and Mahdian (2000), and are related to open problems of Alon and Mohar (2002) and Kaiser and Kang (2014).

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Distance Colouring Without One Cycle Length
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Distance Colouring Without One Cycle Length
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Distance Colouring Without One Cycle Length
      Available formats
      ×
Copyright
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
References
Hide All
[1] Alon, N., Krivelevich, M. and Sudakov, B. (1999) Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 7382.
[2] Alon, N. and Mohar, B. (2002) The chromatic number of graph powers. Combin. Probab. Comput. 11 110.
[3] Bernshteyn, A. (2017) The Johansson–Molloy theorem for DP-coloring. arXiv:1708.03843
[4] Bollobás, B. (1978) Extremal Graph Theory, Vol. 11 of London Mathematical Society Monographs, Academic Press.
[5] Bondy, J. A. and Simonovits, M. (1974) Cycles of even length in graphs. J. Combin. Theory Ser. B 16 97105.
[6] Erdős, P. (1988) Problems and results in combinatorial analysis and graph theory. Ann. Discrete Math. 38 8192.
[7] Feit, W. and Higman, G. (1964) The nonexistence of certain generalized polygons. J. Algebra 1 114131.
[8] Johansson, A. (1996) Asymptotic choice number for triangle-free graphs. Technical report 91-5, DIMACS.
[9] Kaiser, T. and Kang, R. J. (2014) The distance-t chromatic index of graphs. Combin. Probab. Comput. 23 90101.
[10] Kang, R. J. and Pirot, F. (2016) Coloring powers and girth. SIAM J. Discrete Math. 30 19381949.
[11] Mahdian, M. (2000) The strong chromatic index of C 4-free graphs. Random Struct. Alg. 17 357375.
[12] Molloy, M. (2017) The list chromatic number of graphs with small clique number. arXiv:1701.09133
[13] Pikhurko, O. (2012) A note on the Turán function of even cycles. Proc. Amer. Math. Soc. 140 36873692.
[14] Vizing, V. G. (1968) Some unsolved problems in graph theory. Uspekhi Mat. Nauk 23 117134.
[15] Vu, V. H. (2002) A general upper bound on the list chromatic number of locally sparse graphs. Combin. Probab. Comput. 11 103111.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 22 *
Loading metrics...

Abstract views

Total abstract views: 58 *
Loading metrics...

* Views captured on Cambridge Core between 25th March 2018 - 19th April 2018. This data will be updated every 24 hours.