Defective DP-colorings of sparse multigraphs
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study (i,j)-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider fDP(i,j,n) — the minimum number of edges that may ha...
Saved in:
Published in | European journal of combinatorics Vol. 93; p. 103267 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.03.2021
|
Online Access | Get full text |
Cover
Loading…
Abstract | DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study (i,j)-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider fDP(i,j,n) — the minimum number of edges that may have an n-vertex (i,j)-critical multigraph, that is, a multigraph G that has no (i,j)-defective DP-coloring but whose every proper subgraph has such a coloring. For every i and j, we find linear lower bounds on fDP(i,j,n) that are exact for infinitely many n. |
---|---|
AbstractList | DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study (i,j)-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider fDP(i,j,n) — the minimum number of edges that may have an n-vertex (i,j)-critical multigraph, that is, a multigraph G that has no (i,j)-defective DP-coloring but whose every proper subgraph has such a coloring. For every i and j, we find linear lower bounds on fDP(i,j,n) that are exact for infinitely many n. |
ArticleNumber | 103267 |
Author | Kostochka, Alexandr Ma, Fuhong Sittitrai, Pongpat Xu, Jingwei Jing, Yifan |
Author_xml | – sequence: 1 givenname: Yifan surname: Jing fullname: Jing, Yifan email: yifanj6@illinois.edu organization: Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA – sequence: 2 givenname: Alexandr surname: Kostochka fullname: Kostochka, Alexandr email: kostochk@math.uiuc.edu organization: Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA – sequence: 3 givenname: Fuhong surname: Ma fullname: Ma, Fuhong email: fma@ustc.edu.cn organization: School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, China – sequence: 4 givenname: Pongpat surname: Sittitrai fullname: Sittitrai, Pongpat email: pongpat_s@kkumail.com organization: Department of Mathematics, Faculty of Science, Khon Kaen University, 40002, Thailand – sequence: 5 givenname: Jingwei surname: Xu fullname: Xu, Jingwei email: jx6@illinois.edu organization: Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA |
BookMark | eNp9j0FOwzAQRS1UJNrCAdjlAKTMxLVdixVqKSBVggWsrcQeF0dtEtmhErcnUVmzmj-L9_XfjE2atiHGbhEWCCjv6wXVdlFAMf68kOqCTRG0yLVWOGFTwCFLqVdXbJZSDYAoOJ-yuw15sn04UbZ5z217aGNo9ilrfZa6MibKjt-HPuxj2X2la3bpy0Oim787Z5_bp4_1S757e35dP-5yy5fQ50r7SkpHyCuhwIGXnASKSirhufKWS9TaIdfeOSSwstCVVbSUyoOsVprPGZ57bWxTiuRNF8OxjD8GwYy6pjaDrhl1zVl3YB7ODA3DToGiSTZQY8mFOAga14Z_6F9FYF3- |
CitedBy_id | crossref_primary_10_1016_j_disc_2021_112637 crossref_primary_10_1016_j_dam_2023_10_004 crossref_primary_10_1002_jgt_22817 crossref_primary_10_1016_j_disc_2024_113899 |
Cites_doi | 10.1002/jgt.3190110408 10.1007/s00493-018-3733-1 10.1016/j.dam.2011.06.021 10.7151/dmgt.1557 10.1002/jgt.3190100207 10.1017/S0963548319000063 10.1017/S0963548399003752 10.1016/j.jctb.2017.09.001 10.1137/141002177 10.1002/jgt.20155 10.1016/j.disc.2011.11.031 10.1016/j.disc.2013.07.014 10.1016/j.ejc.2014.05.003 10.1002/jgt.21731 10.1002/jgt.21659 10.1002/jgt.21886 10.1002/jgt.20467 10.1016/S0012-365X(99)00145-4 10.1016/j.disc.2017.06.014 10.1016/j.jctb.2013.10.002 10.1016/j.ejc.2009.11.013 10.1134/S0037446617010049 10.1112/jlms.12127 |
ContentType | Journal Article |
Copyright | 2020 Elsevier Ltd |
Copyright_xml | – notice: 2020 Elsevier Ltd |
DBID | AAYXX CITATION |
DOI | 10.1016/j.ejc.2020.103267 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics |
EISSN | 1095-9971 |
ExternalDocumentID | 10_1016_j_ejc_2020_103267 S0195669820301876 |
GrantInformation_xml | – fundername: Russian Foundation for Basic Research grantid: 18-01-00353A; 19-01-00682 funderid: http://dx.doi.org/10.13039/501100002261 – fundername: Arnold O. Beckman Campus Research Board, USA – fundername: NSF, USA grantid: DMS-1600592 funderid: http://dx.doi.org/10.13039/100000001 – fundername: Arnold O. Beckman Campus Research Board, USA grantid: RB20003 |
GroupedDBID | --K --M -ET -~X .~1 0R~ 1B1 1RT 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AASFE AAXUO ABAOU ABFNM ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ADBBV ADEZE ADFGL ADIYS ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HVGLF HZ~ H~9 IHE IXB J1W KOM LG5 M25 M41 MCRUF MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSW SSZ T5K WUQ XPP ZMT ZU3 ~G- 0SF AAXKI AAYXX ADVLN AFJKZ AKRWK CITATION |
ID | FETCH-LOGICAL-c340t-79fb66de13b570d0f63e515b675f37fc36199d139fdd1e0c629bc7e467f06b893 |
IEDL.DBID | AIKHN |
ISSN | 0195-6698 |
IngestDate | Thu Sep 26 19:12:55 EDT 2024 Fri Feb 23 02:49:02 EST 2024 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c340t-79fb66de13b570d0f63e515b675f37fc36199d139fdd1e0c629bc7e467f06b893 |
OpenAccessLink | https://www.sciencedirect.com/science/article/am/pii/S0195669820301876 |
ParticipantIDs | crossref_primary_10_1016_j_ejc_2020_103267 elsevier_sciencedirect_doi_10_1016_j_ejc_2020_103267 |
PublicationCentury | 2000 |
PublicationDate | March 2021 2021-03-00 |
PublicationDateYYYYMMDD | 2021-03-01 |
PublicationDate_xml | – month: 03 year: 2021 text: March 2021 |
PublicationDecade | 2020 |
PublicationTitle | European journal of combinatorics |
PublicationYear | 2021 |
Publisher | Elsevier Ltd |
Publisher_xml | – name: Elsevier Ltd |
References | Dorbec, Kaiser, Montassier, Raspaud (b11) 2014; 75 Borodin, Kostochka, Yancey (b8) 2013; 313 Lovász (b22) 1966; 1 Borodin, Ivanova, Montassier, Raspaud (b5) 2012; 312 Škrekovski (b26) 2000; 214 Borodin, Ivanova, Montassier, Ochem, Raspaud (b3) 2010; 65 Hendrey, Wood (b17) 2019; 28 Woodall (b28) 2011; 31 Dvořák, Postle (b12) 2018; 129 Škrekovski (b25) 1999; 8 Borodin, Kostochka (b6) 2011; 52 Cushing, Kierstead (b10) 2010; 31 Kopreski, Yu (b21) 2017; 340 Edwards, Kang, Kim, Oum, Seymour (b14) 2015; 29 Van den Heuvel, Wood (b18) 2018; 98 Archdeacon (b1) 1987; 11 Ossona de Mendez, Oum, Wood (b23) 2019; 39 P. Sittitrai, K. Nakprasit, Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring, to appear in . Eaton, Hull (b13) 1999; 25 Wood (b27) 2018; #DS23 Cowen, Cowen, Woodall (b9) 1986; 10 Esperet, Montassier, Ochem, Pinlou (b15) 2013; 73 Havet, Sereni (b16) 2006; 52 Bernshteyn, Kostochka, Pron (b2) 2017; 58 Kim, Kostochka, Zhu (b20) 2015; 81 Borodin, Ivanova, Montassier, Raspaud (b4) 2011; 159 Borodin, Kostochka (b7) 2014; 104 Kim, Kostochka, Zhu (b19) 2014; 42 Borodin (10.1016/j.ejc.2020.103267_b6) 2011; 52 Esperet (10.1016/j.ejc.2020.103267_b15) 2013; 73 Ossona de Mendez (10.1016/j.ejc.2020.103267_b23) 2019; 39 Borodin (10.1016/j.ejc.2020.103267_b7) 2014; 104 Dvořák (10.1016/j.ejc.2020.103267_b12) 2018; 129 Borodin (10.1016/j.ejc.2020.103267_b5) 2012; 312 Woodall (10.1016/j.ejc.2020.103267_b28) 2011; 31 Cowen (10.1016/j.ejc.2020.103267_b9) 1986; 10 Škrekovski (10.1016/j.ejc.2020.103267_b26) 2000; 214 10.1016/j.ejc.2020.103267_b24 Eaton (10.1016/j.ejc.2020.103267_b13) 1999; 25 Van den Heuvel (10.1016/j.ejc.2020.103267_b18) 2018; 98 Borodin (10.1016/j.ejc.2020.103267_b4) 2011; 159 Archdeacon (10.1016/j.ejc.2020.103267_b1) 1987; 11 Wood (10.1016/j.ejc.2020.103267_b27) 2018; #DS23 Edwards (10.1016/j.ejc.2020.103267_b14) 2015; 29 Lovász (10.1016/j.ejc.2020.103267_b22) 1966; 1 Cushing (10.1016/j.ejc.2020.103267_b10) 2010; 31 Borodin (10.1016/j.ejc.2020.103267_b8) 2013; 313 Bernshteyn (10.1016/j.ejc.2020.103267_b2) 2017; 58 Havet (10.1016/j.ejc.2020.103267_b16) 2006; 52 Hendrey (10.1016/j.ejc.2020.103267_b17) 2019; 28 Kim (10.1016/j.ejc.2020.103267_b19) 2014; 42 Borodin (10.1016/j.ejc.2020.103267_b3) 2010; 65 Kim (10.1016/j.ejc.2020.103267_b20) 2015; 81 Dorbec (10.1016/j.ejc.2020.103267_b11) 2014; 75 Kopreski (10.1016/j.ejc.2020.103267_b21) 2017; 340 Škrekovski (10.1016/j.ejc.2020.103267_b25) 1999; 8 |
References_xml | – volume: 1 start-page: 237 year: 1966 end-page: 238 ident: b22 article-title: On decomposition of graphs publication-title: Studia Sci. Math. Hungar. contributor: fullname: Lovász – volume: 313 start-page: 2638 year: 2013 end-page: 2649 ident: b8 article-title: On 1-improper 2-coloring of sparse graphs publication-title: Discrete Math. contributor: fullname: Yancey – volume: 10 start-page: 187 year: 1986 end-page: 195 ident: b9 article-title: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency publication-title: J. Graph Theory contributor: fullname: Woodall – volume: #DS23 year: 2018 ident: b27 article-title: Defective and clustered graph colouring publication-title: Electron. J. Combin. contributor: fullname: Wood – volume: 31 start-page: 1385 year: 2010 end-page: 1397 ident: b10 article-title: Planar graphs are 1-relaxed 4-choosable publication-title: European J. Combin. contributor: fullname: Kierstead – volume: 340 start-page: 2528 year: 2017 end-page: 2530 ident: b21 article-title: Maximum average degree and relaxed coloring publication-title: Discrete Math. contributor: fullname: Yu – volume: 29 start-page: 2385 year: 2015 end-page: 2388 ident: b14 article-title: A relative of Hadwiger’s conjecture publication-title: SIAM J. Discrete Math. contributor: fullname: Seymour – volume: 312 start-page: 1128 year: 2012 end-page: 1135 ident: b5 article-title: -coloring of sparse graphs publication-title: Discrete Math. contributor: fullname: Raspaud – volume: 159 start-page: 1947 year: 2011 end-page: 1953 ident: b4 article-title: -coloring of sparse graphs publication-title: Discrete Appl. Math. contributor: fullname: Raspaud – volume: 8 start-page: 293 year: 1999 end-page: 299 ident: b25 article-title: List improper colourings of planar graphs publication-title: Combin. Probab. Comput. contributor: fullname: Škrekovski – volume: 28 start-page: 791 year: 2019 end-page: 810 ident: b17 article-title: Defective and clustered choosability of sparse graphs publication-title: Combin. Probab. Comput. contributor: fullname: Wood – volume: 73 start-page: 85 year: 2013 end-page: 102 ident: b15 article-title: A complexity dichotomy for the coloring of sparse graphs publication-title: J. Graph Theory contributor: fullname: Pinlou – volume: 31 start-page: 441 year: 2011 end-page: 459 ident: b28 article-title: Defective choosability of graphs in surfaces publication-title: Discuss. Math. Graph Theory contributor: fullname: Woodall – volume: 104 start-page: 72 year: 2014 end-page: 80 ident: b7 article-title: Defective 2-colorings of sparse graphs publication-title: J. Combin. Theory Ser. B contributor: fullname: Kostochka – volume: 81 start-page: 403 year: 2015 end-page: 413 ident: b20 article-title: Improper coloring of sparse graphs with a given girth, II: Constructions publication-title: J. Graph Theory contributor: fullname: Zhu – volume: 52 start-page: 181 year: 2006 end-page: 199 ident: b16 article-title: Improper choosability of graphs and maximum average degree publication-title: J. Graph Theory contributor: fullname: Sereni – volume: 39 start-page: 377 year: 2019 end-page: 410 ident: b23 article-title: Defective colouring of graphs excluding a subgraph or minor publication-title: Combinatorica contributor: fullname: Wood – volume: 65 start-page: 83 year: 2010 end-page: 93 ident: b3 article-title: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most publication-title: J. Graph Theory contributor: fullname: Raspaud – volume: 129 start-page: 38 year: 2018 end-page: 54 ident: b12 article-title: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 publication-title: J. Combin. Theory Ser. B contributor: fullname: Postle – volume: 98 start-page: 129 year: 2018 end-page: 148 ident: b18 article-title: Improper colourings inspired by Hadwiger’s conjecture publication-title: J. Lond. Math. Soc. contributor: fullname: Wood – volume: 25 start-page: 79 year: 1999 end-page: 87 ident: b13 article-title: Defective list colorings of planar graphs publication-title: Bull. Inst. Combin. Appl. contributor: fullname: Hull – volume: 214 start-page: 221 year: 2000 end-page: 233 ident: b26 article-title: List improper colorings of planar graphs with prescribed girth publication-title: Discrete Math. contributor: fullname: Škrekovski – volume: 58 start-page: 28 year: 2017 end-page: 36 ident: b2 article-title: On DP-coloring of graphs and multigraphs publication-title: Sib. Math. J. contributor: fullname: Pron – volume: 75 start-page: 191 year: 2014 end-page: 202 ident: b11 article-title: Limits of near-coloring of sparse graphs publication-title: J. Graph Theory contributor: fullname: Raspaud – volume: 11 start-page: 517 year: 1987 end-page: 519 ident: b1 article-title: A note on defective colorings of graphs in surfaces publication-title: J. Graph Theory contributor: fullname: Archdeacon – volume: 52 start-page: 1004 year: 2011 end-page: 1010 ident: b6 article-title: Vertex decompositions of sparse graphs into an independent set and a subgraph of maximum degree at most 1 publication-title: Sibirsk. Mat. Zh. contributor: fullname: Kostochka – volume: 42 start-page: 26 year: 2014 end-page: 48 ident: b19 article-title: Improper coloring of sparse graphs with a given girth, I: publication-title: European J. Combin. contributor: fullname: Zhu – volume: 11 start-page: 517 year: 1987 ident: 10.1016/j.ejc.2020.103267_b1 article-title: A note on defective colorings of graphs in surfaces publication-title: J. Graph Theory doi: 10.1002/jgt.3190110408 contributor: fullname: Archdeacon – volume: 39 start-page: 377 year: 2019 ident: 10.1016/j.ejc.2020.103267_b23 article-title: Defective colouring of graphs excluding a subgraph or minor publication-title: Combinatorica doi: 10.1007/s00493-018-3733-1 contributor: fullname: Ossona de Mendez – ident: 10.1016/j.ejc.2020.103267_b24 – volume: 159 start-page: 1947 year: 2011 ident: 10.1016/j.ejc.2020.103267_b4 article-title: (k,j)-coloring of sparse graphs publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2011.06.021 contributor: fullname: Borodin – volume: 25 start-page: 79 year: 1999 ident: 10.1016/j.ejc.2020.103267_b13 article-title: Defective list colorings of planar graphs publication-title: Bull. Inst. Combin. Appl. contributor: fullname: Eaton – volume: 31 start-page: 441 year: 2011 ident: 10.1016/j.ejc.2020.103267_b28 article-title: Defective choosability of graphs in surfaces publication-title: Discuss. Math. Graph Theory doi: 10.7151/dmgt.1557 contributor: fullname: Woodall – volume: 52 start-page: 1004 year: 2011 ident: 10.1016/j.ejc.2020.103267_b6 article-title: Vertex decompositions of sparse graphs into an independent set and a subgraph of maximum degree at most 1 publication-title: Sibirsk. Mat. Zh. contributor: fullname: Borodin – volume: 10 start-page: 187 year: 1986 ident: 10.1016/j.ejc.2020.103267_b9 article-title: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency publication-title: J. Graph Theory doi: 10.1002/jgt.3190100207 contributor: fullname: Cowen – volume: 28 start-page: 791 year: 2019 ident: 10.1016/j.ejc.2020.103267_b17 article-title: Defective and clustered choosability of sparse graphs publication-title: Combin. Probab. Comput. doi: 10.1017/S0963548319000063 contributor: fullname: Hendrey – volume: 8 start-page: 293 year: 1999 ident: 10.1016/j.ejc.2020.103267_b25 article-title: List improper colourings of planar graphs publication-title: Combin. Probab. Comput. doi: 10.1017/S0963548399003752 contributor: fullname: Škrekovski – volume: 1 start-page: 237 year: 1966 ident: 10.1016/j.ejc.2020.103267_b22 article-title: On decomposition of graphs publication-title: Studia Sci. Math. Hungar. contributor: fullname: Lovász – volume: 129 start-page: 38 year: 2018 ident: 10.1016/j.ejc.2020.103267_b12 article-title: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 publication-title: J. Combin. Theory Ser. B doi: 10.1016/j.jctb.2017.09.001 contributor: fullname: Dvořák – volume: 29 start-page: 2385 year: 2015 ident: 10.1016/j.ejc.2020.103267_b14 article-title: A relative of Hadwiger’s conjecture publication-title: SIAM J. Discrete Math. doi: 10.1137/141002177 contributor: fullname: Edwards – volume: 52 start-page: 181 year: 2006 ident: 10.1016/j.ejc.2020.103267_b16 article-title: Improper choosability of graphs and maximum average degree publication-title: J. Graph Theory doi: 10.1002/jgt.20155 contributor: fullname: Havet – volume: 312 start-page: 1128 year: 2012 ident: 10.1016/j.ejc.2020.103267_b5 article-title: (k,1)-coloring of sparse graphs publication-title: Discrete Math. doi: 10.1016/j.disc.2011.11.031 contributor: fullname: Borodin – volume: 313 start-page: 2638 year: 2013 ident: 10.1016/j.ejc.2020.103267_b8 article-title: On 1-improper 2-coloring of sparse graphs publication-title: Discrete Math. doi: 10.1016/j.disc.2013.07.014 contributor: fullname: Borodin – volume: 42 start-page: 26 year: 2014 ident: 10.1016/j.ejc.2020.103267_b19 article-title: Improper coloring of sparse graphs with a given girth, I: (0,1)-colorings of triangle-free graphs publication-title: European J. Combin. doi: 10.1016/j.ejc.2014.05.003 contributor: fullname: Kim – volume: 75 start-page: 191 year: 2014 ident: 10.1016/j.ejc.2020.103267_b11 article-title: Limits of near-coloring of sparse graphs publication-title: J. Graph Theory doi: 10.1002/jgt.21731 contributor: fullname: Dorbec – volume: #DS23 year: 2018 ident: 10.1016/j.ejc.2020.103267_b27 article-title: Defective and clustered graph colouring publication-title: Electron. J. Combin. contributor: fullname: Wood – volume: 73 start-page: 85 year: 2013 ident: 10.1016/j.ejc.2020.103267_b15 article-title: A complexity dichotomy for the coloring of sparse graphs publication-title: J. Graph Theory doi: 10.1002/jgt.21659 contributor: fullname: Esperet – volume: 81 start-page: 403 year: 2015 ident: 10.1016/j.ejc.2020.103267_b20 article-title: Improper coloring of sparse graphs with a given girth, II: Constructions publication-title: J. Graph Theory doi: 10.1002/jgt.21886 contributor: fullname: Kim – volume: 65 start-page: 83 year: 2010 ident: 10.1016/j.ejc.2020.103267_b3 article-title: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k publication-title: J. Graph Theory doi: 10.1002/jgt.20467 contributor: fullname: Borodin – volume: 214 start-page: 221 year: 2000 ident: 10.1016/j.ejc.2020.103267_b26 article-title: List improper colorings of planar graphs with prescribed girth publication-title: Discrete Math. doi: 10.1016/S0012-365X(99)00145-4 contributor: fullname: Škrekovski – volume: 340 start-page: 2528 year: 2017 ident: 10.1016/j.ejc.2020.103267_b21 article-title: Maximum average degree and relaxed coloring publication-title: Discrete Math. doi: 10.1016/j.disc.2017.06.014 contributor: fullname: Kopreski – volume: 104 start-page: 72 year: 2014 ident: 10.1016/j.ejc.2020.103267_b7 article-title: Defective 2-colorings of sparse graphs publication-title: J. Combin. Theory Ser. B doi: 10.1016/j.jctb.2013.10.002 contributor: fullname: Borodin – volume: 31 start-page: 1385 year: 2010 ident: 10.1016/j.ejc.2020.103267_b10 article-title: Planar graphs are 1-relaxed 4-choosable publication-title: European J. Combin. doi: 10.1016/j.ejc.2009.11.013 contributor: fullname: Cushing – volume: 58 start-page: 28 issue: 1 year: 2017 ident: 10.1016/j.ejc.2020.103267_b2 article-title: On DP-coloring of graphs and multigraphs publication-title: Sib. Math. J. doi: 10.1134/S0037446617010049 contributor: fullname: Bernshteyn – volume: 98 start-page: 129 year: 2018 ident: 10.1016/j.ejc.2020.103267_b18 article-title: Improper colourings inspired by Hadwiger’s conjecture publication-title: J. Lond. Math. Soc. doi: 10.1112/jlms.12127 contributor: fullname: Van den Heuvel |
SSID | ssj0011533 |
Score | 2.3408432 |
Snippet | DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study... |
SourceID | crossref elsevier |
SourceType | Aggregation Database Publisher |
StartPage | 103267 |
Title | Defective DP-colorings of sparse multigraphs |
URI | https://dx.doi.org/10.1016/j.ejc.2020.103267 |
Volume | 93 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED71scCAeIryqDIwIUwdOy-PVUtVqFohoKJbFCe21A5t1ZSV387ZSSqQYGGKFMlRcpa_-xx_9x3ADe62IhnyhGiaMOKpSBIhuSSJ5mkgIj9hyhQKjyfBcOo9zfxZDXpVLYyRVZbYX2C6RevyTqeMZmc9n3debakbPo8ZVo-Lug5NTEcsakCz-zgaTnaHCYbSVG0JzYDqcNPKvNTCGBkyW33ObLf5X9LTt5QzOISDkis63eJ1jqCmlsewP94ZreYncNdXuoAsp_9MjAO1-U-XOyvtIFRscuVYxaC1pc5PYTp4eOsNSdkAgaTco1sSCi2DIFMul35IM6oDrpB_SCT5moc65bj7ERlyOJ1lrqJpwIRMQ4XYp2kgkYmcQWO5WqpzcCKd0oR7WnnG4koKGabSFVGCGZv52mUtuK2-O14XPhdxJQBbxBik2AQpLoLUAq-KTPxjsmLE4b-HXfxv2CXsMSMkscKvK2hsNx_qGpnAVrahfv_ptsv5NtfRy_voC25mseM |
link.rule.ids | 315,783,787,4509,24128,27936,27937,45597,45691 |
linkProvider | Elsevier |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JasMwEB3S5ND2ULrSdPWhp1IRR_KmY0ganGah0ARyE5YtQXJIQpz-f0eyHVpoL70aZOQRevNkvXkD8ISnrUiGLCHaTSjxVCQJl0ySRLM04JGfUGUKhceTIJ55b3N_XoNuVQtjZJUl9heYbtG6fNIqo9naLBatD1vqhu-jhtXjpj6ABrIBjruz0RkM48n-MsFQmqotoRlQXW5amZdaGiNDaqvPqe02_0t6-pZy-qdwUnJFp1NM5wxqanUOx-O90Wp-AS89pQvIcnrvxDhQm_90ubPWDkLFNleOVQxaW-r8Emb912k3JmUDBJIyz92RkGsZBJlqM-mHbubqgCnkHxJJvmahThmefniGHE5nWVu5aUC5TEOF2KfdQCITuYL6ar1S1-BEOnUT5mnlGYsryWWYyjaPEszY1Ndt2oTn6rvFpvC5EJUAbCkwSMIESRRBaoJXRUb8WCyBOPz3sJv_DXuEw3g6HonRYDK8hSNqRCVWBHYH9d32U90jK9jJh3LVvwAxpLI0 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Defective+DP-colorings+of+sparse+multigraphs&rft.jtitle=European+journal+of+combinatorics&rft.au=Jing%2C+Yifan&rft.au=Kostochka%2C+Alexandr&rft.au=Ma%2C+Fuhong&rft.au=Sittitrai%2C+Pongpat&rft.date=2021-03-01&rft.pub=Elsevier+Ltd&rft.issn=0195-6698&rft.eissn=1095-9971&rft.volume=93&rft_id=info:doi/10.1016%2Fj.ejc.2020.103267&rft.externalDocID=S0195669820301876 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0195-6698&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0195-6698&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0195-6698&client=summon |