Strong chromatic index of planar graphs with large girth
| hal.structure.identifier | Taida Institute of Mathematical Science [TIMS] | |
| dc.contributor.author | CHANG, Gerard Jennhwa | |
| hal.structure.identifier | Algorithmes, Graphes et Combinatoire [ALGCO] | |
| dc.contributor.author | MONTASSIER, Mickaël | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | PÊCHER, Arnaud | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | RASPAUD, André | |
| dc.date.accessioned | 2024-04-04T02:20:37Z | |
| dc.date.available | 2024-04-04T02:20:37Z | |
| dc.date.issued | 2014 | |
| dc.identifier.issn | 1234-3099 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189507 | |
| dc.description.abstractEn | Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [6] when Δ ≥ 6. | |
| dc.language.iso | en | |
| dc.publisher | University of Zielona Góra | |
| dc.subject.en | Planar graphs | |
| dc.subject.en | Edge coloring | |
| dc.subject.en | 2-distance coloring | |
| dc.subject.en | Strong edgecoloring | |
| dc.title.en | Strong chromatic index of planar graphs with large girth | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.7151/dmgt.1763 | |
| dc.subject.hal | Sciences de l'Homme et Société/Sciences de l'information et de la communication | |
| bordeaux.journal | Discussiones Mathematicae Graph Theory | |
| bordeaux.page | 723-733 | |
| bordeaux.volume | 34 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 4 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00920932 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00920932v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Discussiones%20Mathematicae%20Graph%20Theory&rft.date=2014&rft.volume=34&rft.issue=4&rft.spage=723-733&rft.epage=723-733&rft.eissn=1234-3099&rft.issn=1234-3099&rft.au=CHANG,%20Gerard%20Jennhwa&MONTASSIER,%20Micka%C3%ABl&P%C3%8ACHER,%20Arnaud&RASPAUD,%20Andr%C3%A9&rft.genre=article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||