Article Dans Une Revue Journal of Graph Theory Année : 2022

Strong chromatic index and Hadwiger number

Résumé

We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each that any ‐minor‐free multigraph of maximum degree has strong chromatic index at most . We present a construction certifying that if true the conjecture is asymptotically sharp as . In support of the conjecture, we show it in the case and prove the statement for strong clique number in place of strong chromatic index. By contrast, we make a basic observation that for ‐minor‐free simple graphs, the problem of strong edge‐colouring is “between” Hadwiger's Conjecture and its fractional relaxation. For , we also show that ‐minor‐free multigraphs of edge‐diameter at most 2 have strong clique number at most .

Fichier principal
Vignette du fichier
250520.pdf (1.06 Mo) Télécharger le fichier
Origine Publication financée par une institution
Licence

Dates et versions

hal-04245487 , version 1 (12-01-2024)

Licence

Identifiants

Citer

Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot. Strong chromatic index and Hadwiger number. Journal of Graph Theory, 2022, 100 (3), pp.435-457. ⟨10.1002/jgt.22788⟩. ⟨hal-04245487⟩
93 Consultations
205 Téléchargements

Altmetric

Partager

  • More