Strong edge-colorings of sparse graphs with large maximum degree

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 101
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorChoi, Ilkyooko
dc.contributor.authorKim, Jaehoonko
dc.contributor.authorKostochka, Alexandr V.ko
dc.contributor.authorRaspaud, Andreko
dc.date.accessioned2019-07-18T05:34:10Z-
dc.date.available2019-07-18T05:34:10Z-
dc.date.created2019-07-17-
dc.date.created2019-07-17-
dc.date.created2019-07-17-
dc.date.issued2018-01-
dc.identifier.citationEUROPEAN JOURNAL OF COMBINATORICS, v.67, pp.21 - 39-
dc.identifier.issn0195-6698-
dc.identifier.urihttp://hdl.handle.net/10203/263342-
dc.description.abstractA strong k-edge-coloring of a graph G is a mapping from E(G) to {1, 2, ... , k} such that every two adjacent edges or two edges adjacent to the same edge receive distinct colors. The strong chromatic index X's( G) of a graph G is the smallest integer k such that G admits a strong k-edge-coloring. We give bounds on X's(G) in terms of the maximum degree Delta(G) of a graph G when G is sparse, namely, when G is 2-degenerate or when the maximum average degree Mad(G) is small. We prove that the strong chromatic index of each 2-degenerate graph G is at most 5 Delta(G) + 1. Furthermore, we show that for a graph G, if Mad(G) < 8/3 and Delta(G) >= 9, then X's(G) <= 3 Delta(G) 3 (the bound 3 Delta(G) - 3 is sharp) and if Mad(G) < 3 and Delta(G) >= 7, then X's(G) <= 3 Delta(G) (the restriction Mad(G) < 3 is sharp). (C) 2017 Published by Elsevier Ltd.-
dc.languageEnglish-
dc.publisherACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD-
dc.titleStrong edge-colorings of sparse graphs with large maximum degree-
dc.typeArticle-
dc.identifier.wosid000413385900002-
dc.identifier.scopusid2-s2.0-85026674340-
dc.type.rimsART-
dc.citation.volume67-
dc.citation.beginningpage21-
dc.citation.endingpage39-
dc.citation.publicationnameEUROPEAN JOURNAL OF COMBINATORICS-
dc.identifier.doi10.1016/j.ejc.2017.06.001-
dc.contributor.localauthorKim, Jaehoon-
dc.contributor.nonIdAuthorChoi, Ilkyoo-
dc.contributor.nonIdAuthorKostochka, Alexandr V.-
dc.contributor.nonIdAuthorRaspaud, Andre-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordPlusSTRONG CHROMATIC INDEX-
dc.subject.keywordPlusK-DEGENERATE GRAPHS-
dc.subject.keywordPlusPLANAR GRAPHS-
dc.subject.keywordPlusNETWORKS-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0