Szczegóły publikacji
Opis bibliograficzny
The strong (2,2)-Conjecture for more classes of graphs / Olivier Baudon, Julien Bensmail, Morgan Boivin, Igor GRZELEC, Clara Marcille // Discrete Applied Mathematics ; ISSN 0166-218X . — 2026 — vol. 382, s. 337–354. — Bibliogr. s. 354, Abstr. — Publikacja dostępna online od: 2025-12-15
Autorzy (5)
- Baudon Olivier
- Bensmail Julien
- Boivin Morgan
- AGHGrzelec Igor
- Marcille Clara
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 165591 |
|---|---|
| Data dodania do BaDAP | 2026-02-03 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.dam.2025.12.011 |
| Rok publikacji | 2026 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Applied Mathematics |
Abstract
The Strong (2,2)-Conjecture asks whether, for all connected graphs different from K2 and K3, we can assign to edges red and blue labels with value 1 or 2 so that no two adjacent vertices have the same sum of incident red labels or the same sum of incident blue labels. This conjecture, which can be perceived as a generalisation of the so-called 1–2–3 Conjecture, as, thus far, been proved only for a handful number of graph classes. In this work, we prove the Strong (2,2)-Conjecture holds for more classes of graphs. In particular, we prove the conjecture for cacti, subcubic outerplanar graphs, graphs with maximum average degree less than 94, and some Halin graphs, among others.
