Defective incidence coloring of graphs

•Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence colorings of certain graphs are presented.•Relation between the 1-defective incidence (n−1)-coloring and Latin square of order n is given. W...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied mathematics and computation Ročník 443; s. 127781
Hlavní autori: Bi, Huimin, Zhang, Xin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 15.04.2023
Predmet:
ISSN:0096-3003, 1873-5649
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract •Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence colorings of certain graphs are presented.•Relation between the 1-defective incidence (n−1)-coloring and Latin square of order n is given. We define the d-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and outerplanar graphs. Fast algorithms for constructing the optimal d-defective incidence colorings of those graphs are presented.
AbstractList •Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence colorings of certain graphs are presented.•Relation between the 1-defective incidence (n−1)-coloring and Latin square of order n is given. We define the d-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and outerplanar graphs. Fast algorithms for constructing the optimal d-defective incidence colorings of those graphs are presented.
ArticleNumber 127781
Author Zhang, Xin
Bi, Huimin
Author_xml – sequence: 1
  givenname: Huimin
  surname: Bi
  fullname: Bi, Huimin
– sequence: 2
  givenname: Xin
  orcidid: 0000-0001-5250-1657
  surname: Zhang
  fullname: Zhang, Xin
  email: xzhang@xidian.edu.cn
BookMark eNp9zz1PwzAQgGELFYm08APYMrEl3DmOE4sJlU-pEgvMVmyfi6M2qeyqEv-eVGFmuum9u2fJFsM4EGO3CCUCyvu-7Pa25MB5ibxpWrxgGbZNVdRSqAXLAJQsKoDqii1T6gGgkSgydvdEnuwxnCgPgw2OBku5HXdjDMM2H32-jd3hO12zS9_tEt38zRX7enn-XL8Vm4_X9_XjprBcqGMhOvCkprsOkSzVVlTcKSV5LWzTGkkgW4PKSVNjbbAhaZwwnpwDb8ljtWI477VxTCmS14cY9l380Qj6DNW9nqD6DNUzdGoe5oamx06Bok42nB0uxImm3Rj-qX8BBgtclQ
Cites_doi 10.1016/j.dam.2013.10.007
10.7151/dmgt.2076
10.1016/0012-365X(76)90103-5
10.1016/0012-365X(93)90286-3
10.1016/j.dam.2019.04.027
10.1016/j.dam.2009.11.017
10.1016/j.tcs.2021.05.026
10.1016/0012-365X(95)00342-T
10.1016/0012-365X(89)90073-3
10.1016/j.dam.2007.10.021
ContentType Journal Article
Copyright 2022 Elsevier Inc.
Copyright_xml – notice: 2022 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.amc.2022.127781
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1873-5649
ExternalDocumentID 10_1016_j_amc_2022_127781
S0096300322008499
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 11871055
  funderid: https://doi.org/10.13039/501100001809
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
23M
4.4
457
4G.
5GY
6J9
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAXUO
ABAOU
ABFNM
ABFRF
ABJNI
ABMAC
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACRLP
ADBBV
ADEZE
ADGUI
AEBSH
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
AXJTR
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
IHE
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SES
SEW
SME
SPC
SPCBC
SSW
SSZ
T5K
TN5
WH7
X6Y
XPP
ZMT
~02
~G-
5VS
9DU
AAQFI
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABEFU
ABWVN
ABXDB
ACLOT
ACRPL
ACVFH
ADCNI
ADIYS
ADMUD
ADNMO
AEIPS
AEUPX
AFFNX
AFJKZ
AFPUW
AGQPQ
AI.
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EJD
FEDTE
FGOYB
G-2
HLZ
HMJ
HVGLF
HZ~
R2-
TAE
VH1
VOH
WUQ
~HD
ID FETCH-LOGICAL-c249t-4a0fe9187d11ece5c432d996254c78b6e068b19d6b515b17e6bd4bfedd0fcef13
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000909217400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0096-3003
IngestDate Sat Nov 29 07:22:00 EST 2025
Fri Feb 23 02:40:08 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Defective coloring
Polynomial-time algorithm
Latin square
Outerplanar graph
68R10
Incidence coloring
05C15
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c249t-4a0fe9187d11ece5c432d996254c78b6e068b19d6b515b17e6bd4bfedd0fcef13
ORCID 0000-0001-5250-1657
ParticipantIDs crossref_primary_10_1016_j_amc_2022_127781
elsevier_sciencedirect_doi_10_1016_j_amc_2022_127781
PublicationCentury 2000
PublicationDate 2023-04-15
PublicationDateYYYYMMDD 2023-04-15
PublicationDate_xml – month: 04
  year: 2023
  text: 2023-04-15
  day: 15
PublicationDecade 2020
PublicationTitle Applied mathematics and computation
PublicationYear 2023
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Duffy, MacGillivray, Ochem, Raspaud (bib0011) 2019; 39
Janczewski, Małafiejska, Małafiejski (bib0009) 2014; 166
Page last modified on January 28, 2021.
Guiduli (bib0004) 1997; 163
Kotzig, Lindner, Rosa (bib0015) 1975; 7
Yang (bib0010) 2012; 105
Benmedjdoub, Bouchemakh, Sopena (bib0006) 2019; 265
Brualdi, Massey (bib0001) 1993; 122
Andres (bib0008) 2010; 158
Wang, Zhang (bib0017) 1999; 22
McLeish (bib0013) 1975; 8
Kotzig, Turgeon (bib0014) 1976; 16
Algor, Alon (bib0005) 1989; 75
E. Sopena, The incidence coloring page
Bender (bib0012) 2010
Andres (bib0007) 2009; 157
Bi, Zhang (bib0003) 2021; 878
Chartrand, Harary (bib0016) 1967; 3
Algor (10.1016/j.amc.2022.127781_bib0005) 1989; 75
Brualdi (10.1016/j.amc.2022.127781_bib0001) 1993; 122
Yang (10.1016/j.amc.2022.127781_bib0010) 2012; 105
Wang (10.1016/j.amc.2022.127781_bib0017) 1999; 22
Guiduli (10.1016/j.amc.2022.127781_bib0004) 1997; 163
Duffy (10.1016/j.amc.2022.127781_bib0011) 2019; 39
Kotzig (10.1016/j.amc.2022.127781_bib0015) 1975; 7
Bender (10.1016/j.amc.2022.127781_bib0012) 2010
McLeish (10.1016/j.amc.2022.127781_bib0013) 1975; 8
10.1016/j.amc.2022.127781_bib0002
Bi (10.1016/j.amc.2022.127781_bib0003) 2021; 878
Andres (10.1016/j.amc.2022.127781_bib0008) 2010; 158
Kotzig (10.1016/j.amc.2022.127781_bib0014) 1976; 16
Benmedjdoub (10.1016/j.amc.2022.127781_bib0006) 2019; 265
Andres (10.1016/j.amc.2022.127781_bib0007) 2009; 157
Janczewski (10.1016/j.amc.2022.127781_bib0009) 2014; 166
Chartrand (10.1016/j.amc.2022.127781_sbref0016) 1967; 3
References_xml – year: 2010
  ident: bib0012
  article-title: Lists, Decisions and Graphs - With an Introduction to Probability
– volume: 105
  start-page: 213
  year: 2012
  end-page: 224
  ident: bib0010
  article-title: Fractional incidence coloring and star arboricity of graphs
  publication-title: Ars Combin.
– volume: 122
  start-page: 51
  year: 1993
  end-page: 58
  ident: bib0001
  article-title: Incidence and strong edge colorings of graphs
  publication-title: Discrete Math.
– volume: 8
  start-page: 41
  year: 1975
  end-page: 53
  ident: bib0013
  article-title: On the existence of Latin squares with no subsquares of order two
  publication-title: Util. Math.
– volume: 16
  start-page: 263
  year: 1976
  end-page: 270
  ident: bib0014
  article-title: On certain constructions for Latin squares with no Latin subsquares of order two
  publication-title: Discrete Math.
– volume: 166
  start-page: 131
  year: 2014
  end-page: 140
  ident: bib0009
  article-title: Interval incidence coloring of bipartite graphs
  publication-title: Discrete Appl. Math.
– volume: 3
  start-page: 433
  year: 1967
  end-page: 438
  ident: bib0016
  article-title: Planar permutation graphs
  publication-title: Ann. I.H.P. Probab. Stat.
– volume: 7
  start-page: 287
  year: 1975
  end-page: 294
  ident: bib0015
  article-title: Latin squares with no subsquares of order two and disjoint Steiner triple systems
  publication-title: Util. Math.
– reference: . Page last modified on January 28, 2021.
– volume: 158
  start-page: 728
  year: 2010
  ident: bib0008
  article-title: Erratum to: the incidence game chromatic number [Discrete Appl. Math. 157 (9) (2009) 1980–1987] [MR2522464]
  publication-title: Discrete Appl. Math.
– volume: 157
  start-page: 1980
  year: 2009
  end-page: 1987
  ident: bib0007
  article-title: The incidence game chromatic number
  publication-title: Discrete Appl. Math.
– reference: E. Sopena, The incidence coloring page,
– volume: 39
  start-page: 191
  year: 2019
  end-page: 210
  ident: bib0011
  article-title: Oriented incidence colourings of digraphs
  publication-title: Discuss. Math. Graph Theory
– volume: 163
  start-page: 275
  year: 1997
  end-page: 278
  ident: bib0004
  article-title: On incidence coloring and star arboricity of graphs
  publication-title: Discrete Math.
– volume: 75
  start-page: 11
  year: 1989
  end-page: 22
  ident: bib0005
  article-title: The star arboricity of graphs
  publication-title: Discrete Math.
– volume: 878
  start-page: 1
  year: 2021
  end-page: 10
  ident: bib0003
  article-title: Incidence coloring of Mycielskians with fast algorithm
  publication-title: Theor. Comput. Sci.
– volume: 22
  start-page: 236
  year: 1999
  end-page: 242
  ident: bib0017
  article-title: -matchings and edge-face chromatic numbers (in Chinese)
  publication-title: Acta Math. Appl. Sin.
– volume: 265
  start-page: 40
  year: 2019
  end-page: 55
  ident: bib0006
  article-title: Incidence choosability of graphs
  publication-title: Discrete Appl. Math.
– volume: 166
  start-page: 131
  year: 2014
  ident: 10.1016/j.amc.2022.127781_bib0009
  article-title: Interval incidence coloring of bipartite graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2013.10.007
– volume: 3
  start-page: 433
  issue: 4
  year: 1967
  ident: 10.1016/j.amc.2022.127781_sbref0016
  article-title: Planar permutation graphs
  publication-title: Ann. I.H.P. Probab. Stat.
– volume: 39
  start-page: 191
  issue: 1
  year: 2019
  ident: 10.1016/j.amc.2022.127781_bib0011
  article-title: Oriented incidence colourings of digraphs
  publication-title: Discuss. Math. Graph Theory
  doi: 10.7151/dmgt.2076
– volume: 22
  start-page: 236
  year: 1999
  ident: 10.1016/j.amc.2022.127781_bib0017
  article-title: Δ-matchings and edge-face chromatic numbers (in Chinese)
  publication-title: Acta Math. Appl. Sin.
– volume: 105
  start-page: 213
  year: 2012
  ident: 10.1016/j.amc.2022.127781_bib0010
  article-title: Fractional incidence coloring and star arboricity of graphs
  publication-title: Ars Combin.
– ident: 10.1016/j.amc.2022.127781_bib0002
– volume: 16
  start-page: 263
  issue: 3
  year: 1976
  ident: 10.1016/j.amc.2022.127781_bib0014
  article-title: On certain constructions for Latin squares with no Latin subsquares of order two
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(76)90103-5
– volume: 122
  start-page: 51
  issue: 1–3
  year: 1993
  ident: 10.1016/j.amc.2022.127781_bib0001
  article-title: Incidence and strong edge colorings of graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(93)90286-3
– volume: 265
  start-page: 40
  year: 2019
  ident: 10.1016/j.amc.2022.127781_bib0006
  article-title: Incidence choosability of graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2019.04.027
– volume: 158
  start-page: 728
  issue: 6
  year: 2010
  ident: 10.1016/j.amc.2022.127781_bib0008
  article-title: Erratum to: the incidence game chromatic number [Discrete Appl. Math. 157 (9) (2009) 1980–1987] [MR2522464]
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2009.11.017
– volume: 878
  start-page: 1
  issue: 879
  year: 2021
  ident: 10.1016/j.amc.2022.127781_bib0003
  article-title: Incidence coloring of Mycielskians with fast algorithm
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2021.05.026
– volume: 163
  start-page: 275
  issue: 1–3
  year: 1997
  ident: 10.1016/j.amc.2022.127781_bib0004
  article-title: On incidence coloring and star arboricity of graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(95)00342-T
– volume: 75
  start-page: 11
  issue: 1
  year: 1989
  ident: 10.1016/j.amc.2022.127781_bib0005
  article-title: The star arboricity of graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(89)90073-3
– volume: 8
  start-page: 41
  year: 1975
  ident: 10.1016/j.amc.2022.127781_bib0013
  article-title: On the existence of Latin squares with no subsquares of order two
  publication-title: Util. Math.
– volume: 157
  start-page: 1980
  issue: 9
  year: 2009
  ident: 10.1016/j.amc.2022.127781_bib0007
  article-title: The incidence game chromatic number
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2007.10.021
– year: 2010
  ident: 10.1016/j.amc.2022.127781_bib0012
– volume: 7
  start-page: 287
  year: 1975
  ident: 10.1016/j.amc.2022.127781_bib0015
  article-title: Latin squares with no subsquares of order two and disjoint Steiner triple systems
  publication-title: Util. Math.
SSID ssj0007614
Score 2.3978047
Snippet •Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 127781
SubjectTerms Defective coloring
Incidence coloring
Latin square
Outerplanar graph
Polynomial-time algorithm
Title Defective incidence coloring of graphs
URI https://dx.doi.org/10.1016/j.amc.2022.127781
Volume 443
WOSCitedRecordID wos000909217400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect database
  customDbUrl:
  eissn: 1873-5649
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007614
  issn: 0096-3003
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bS8MwFA66-aAP4hXnjT6ID45K2ma5PE6dqKD4oLC30lwKCuvGLrKf72nTdHNT0AdfQgntaZqvnHxJTs6H0FmgsAi1Ej6LJPaJZJEvVUh9LgxJWKISzXUhNsGenni3K55LtbdRISfAsoxPp2Lwr1BDHYCdH539A9yVUaiAawAdSoAdyl8Bf2NS68Sa-TJ6IRnazFNTD8v45iJF9WielDom2qtSuI7ccbfB5OtW_ZUVuZ7kWmBLa87dsq5cRAijfD_EHqN0jlHkIXA4mneMhERzri0IGbPqKkte1y4AvF8mvTwpZBhezu79muF6YeSp4gFdqNl7DCbi3ERsTayieshaAtxVvX3f6T5UgyyjNm27a7fbsC5C9xba8T3lmKMRL1tos-T_Xtvito1WTLaDNh5nPb-LzisEvQpBzyHo9VPPIriHXm87L9d3filn4SuY4459kuDUiIAzHQRGmZYiUahhuglTdMW4pAZTLgOhqQSOKQNmqNREpkZrnCqTBtE-qmX9zBwgD2sOTDCV3EhGKIbxtkWB57YokC-TYtJAF-6L44HNWhL_2McNRFyfxCXtsnQqBnx_fuzwL-84Quuz3-4Y1cbDiTlBa-pj_DYanpbgfgJTLEod
linkProvider Elsevier
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+incidence+coloring+of+graphs&rft.jtitle=Applied+mathematics+and+computation&rft.au=Bi%2C+Huimin&rft.au=Zhang%2C+Xin&rft.date=2023-04-15&rft.issn=0096-3003&rft.volume=443&rft.spage=127781&rft_id=info:doi/10.1016%2Fj.amc.2022.127781&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2022_127781
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon