Brooksʼ Theorem for generalized dart graphs

The well-known Brooksʼ Theorem says that each graph G of maximum degree k ⩾ 3 is k-colorable unless G = K k + 1 . We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood. ► Generalization of Brooks Theorem for ( k , s ) -dart graphs. ► Linear algorithm for...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 112; no. 5; pp. 200 - 204
Main Authors Kochol, Martin, Škrekovski, Riste
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.02.2012
Elsevier Sequoia S.A
Subjects
[formula omitted]-dart graph
[formula omitted]-diamond
Brooksʼ Theorem
Graph algorithms
Graph coloring
Graphs
Mathematical programming
NP-complete problem
Studies
Theorems
Graph algorithms
NP-complete problem
Brooksʼ Theorem
( k , s ) -dart graph
( k , s ) -diamond
Online AccessGet full text
ISSN0020-0190
1872-6119
DOI10.1016/j.ipl.2011.11.010

Cover

Abstract The well-known Brooksʼ Theorem says that each graph G of maximum degree k ⩾ 3 is k-colorable unless G = K k + 1 . We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood. ► Generalization of Brooks Theorem for ( k , s ) -dart graphs. ► Linear algorithm for ( k + 1 ) -coloring of ( k , s ) -dart graphs with s not greater then k. ► NP-completeness for ( k + 1 ) -coloring of ( k , s ) -dart graphs with s greater then k.
AbstractList The well-known Brooks' Theorem says that each graph G of maximum degree k>=3 is k-colorable unless G=Kk+1. We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood.
The well-known Brooksʼ Theorem says that each graph G of maximum degree k ⩾ 3 is k-colorable unless G = K k + 1 . We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood. ► Generalization of Brooks Theorem for ( k , s ) -dart graphs. ► Linear algorithm for ( k + 1 ) -coloring of ( k , s ) -dart graphs with s not greater then k. ► NP-completeness for ( k + 1 ) -coloring of ( k , s ) -dart graphs with s greater then k.
The well-known Brooks' Theorem says that each graph G of maximum degree k 3 is k-colorable unless G=Kk+1. We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood. [PUBLICATION ABSTRACT]
Author Kochol, Martin
Škrekovski, Riste
Author_xml – sequence: 1
  givenname: Martin
  surname: Kochol
  fullname: Kochol, Martin
  email: martin.kochol@mat.savba.sk
  organization: MÚ SAV, Štefánikova 49, 814 73 Bratislava 1, Slovakia
– sequence: 2
  givenname: Riste
  surname: Škrekovski
  fullname: Škrekovski, Riste
  email: skrekovski@gmail.com
  organization: Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia
BookMark eNp9kM1KAzEUhYNUsFYfwN3gyoUz3sxPfnClxT8ouKnrkGbutBmnk5pMBX02n8CnMqWuXAgH7uY7h3vOMRn1rkdCzihkFCi7ajO76bIcKM2igMIBGVPB85RRKkdkDJBDClTCETkOoQUAVhZ8TC5vvXOv4fsrma_QeVwnjfPJEnv0urOfWCe19kOy9HqzCifksNFdwNPfOyEv93fz6WM6e354mt7MUlOAHFJRcVYiLaoKCt40ujHG0AKgkQC1LLkQvBScG1HmRc7A6ApzvsCi4guxYBGdkIt97sa7ty2GQa1tMNh1uke3DSo2BiEl5zv0_A_auq3v43dK0opVOQgRIbqHjHcheGzUxtu19h8xaRfGVKvifGo3n4qK8dFzvfdgLPpu0atgLPYGa-vRDKp29h_3D_iTd20
CODEN IFPLAT
Cites_doi 10.1017/S030500410002168X
10.1016/0095-8956(75)90089-1
10.1016/0012-365X(95)00082-8
10.1016/0304-3975(76)90059-1
10.1137/S0097539702418759
ContentType Journal Article
Copyright 2011 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Feb 28, 2012
Copyright_xml – notice: 2011 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Feb 28, 2012
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ipl.2011.11.010
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-6119
EndPage 204
ExternalDocumentID 2559790191
10_1016_j_ipl_2011_11_010
S0020019011003140
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
SSH
ID FETCH-LOGICAL-c309t-85764e1355037ffafccc1300f900d9478874877c8423260ca5e27be357b8b6c13
IEDL.DBID .~1
ISSN 0020-0190
IngestDate Sat Sep 27 18:40:52 EDT 2025
Mon Jul 14 10:32:38 EDT 2025
Wed Oct 01 03:08:56 EDT 2025
Fri Feb 23 02:16:26 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Graph algorithms
NP-complete problem
Brooksʼ Theorem
( k , s ) -dart graph
( k , s ) -diamond
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c309t-85764e1355037ffafccc1300f900d9478874877c8423260ca5e27be357b8b6c13
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 915652088
PQPubID 45522
PageCount 5
ParticipantIDs proquest_miscellaneous_1010899771
proquest_journals_915652088
crossref_primary_10_1016_j_ipl_2011_11_010
elsevier_sciencedirect_doi_10_1016_j_ipl_2011_11_010
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2012-02-28
PublicationDateYYYYMMDD 2012-02-28
PublicationDate_xml – month: 02
  year: 2012
  text: 2012-02-28
  day: 28
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 2012
Publisher Elsevier B.V
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Sequoia S.A
References Garey, Johnson (br0030) 1979
Skulrattanakulchai (br0090) 2003; vol. 2368
Randerath, Schiermeyer (br0080) 2002; 26
Lovász (br0070) 1975; 19
Bryant (br0020) 1996; 158
Brooks (br0010) 1941; 37
Garey, Johnson, Stockmeyer (br0040) 1976; 1
Kochol, Lozin, Randerath (br0060) 2003; 32
Diestel (br0050) 2005
Lovász (10.1016/j.ipl.2011.11.010_br0070) 1975; 19
Skulrattanakulchai (10.1016/j.ipl.2011.11.010_br0090) 2003; vol. 2368
Bryant (10.1016/j.ipl.2011.11.010_br0020) 1996; 158
Randerath (10.1016/j.ipl.2011.11.010_br0080) 2002; 26
Garey (10.1016/j.ipl.2011.11.010_br0030) 1979
Garey (10.1016/j.ipl.2011.11.010_br0040) 1976; 1
Diestel (10.1016/j.ipl.2011.11.010_br0050) 2005
Brooks (10.1016/j.ipl.2011.11.010_br0010) 1941; 37
Kochol (10.1016/j.ipl.2011.11.010_br0060) 2003; 32
References_xml – year: 1979
  ident: br0030
  article-title: Computers and Intractability
– year: 2005
  ident: br0050
  article-title: Graph Theory
– volume: 158
  start-page: 279
  year: 1996
  end-page: 281
  ident: br0020
  article-title: A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooksʼ theorem
  publication-title: Discrete Math.
– volume: 19
  start-page: 269
  year: 1975
  end-page: 271
  ident: br0070
  article-title: Three short proofs in graph theory
  publication-title: J. Combin. Theory Ser. B
– volume: 37
  start-page: 194
  year: 1941
  end-page: 197
  ident: br0010
  article-title: On coloring the nodes of a network
  publication-title: Proc. Cambridge Philos. Soc.
– volume: 26
  start-page: 3
  year: 2002
  end-page: 10
  ident: br0080
  article-title: A note on Brooks theorem for triangle-free graphs
  publication-title: Australas. J. Combin.
– volume: vol. 2368
  start-page: 240
  year: 2003
  end-page: 248
  ident: br0090
  article-title: Δ-list vertex coloring in linear time
  publication-title: Algorithm Theory – SWAT 2002
– volume: 1
  start-page: 237
  year: 1976
  end-page: 267
  ident: br0040
  article-title: Some simplified NP-complete graph problems
  publication-title: Theoret. Comput. Sci.
– volume: 32
  start-page: 1128
  year: 2003
  end-page: 1139
  ident: br0060
  article-title: The 3-colorability problem on graphs with maximum degree four
  publication-title: SIAM J. Comput.
– volume: 37
  start-page: 194
  year: 1941
  ident: 10.1016/j.ipl.2011.11.010_br0010
  article-title: On coloring the nodes of a network
  publication-title: Proc. Cambridge Philos. Soc.
  doi: 10.1017/S030500410002168X
– volume: 19
  start-page: 269
  year: 1975
  ident: 10.1016/j.ipl.2011.11.010_br0070
  article-title: Three short proofs in graph theory
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(75)90089-1
– year: 2005
  ident: 10.1016/j.ipl.2011.11.010_br0050
– volume: 26
  start-page: 3
  year: 2002
  ident: 10.1016/j.ipl.2011.11.010_br0080
  article-title: A note on Brooks theorem for triangle-free graphs
  publication-title: Australas. J. Combin.
– volume: vol. 2368
  start-page: 240
  year: 2003
  ident: 10.1016/j.ipl.2011.11.010_br0090
  article-title: Δ-list vertex coloring in linear time
– volume: 158
  start-page: 279
  year: 1996
  ident: 10.1016/j.ipl.2011.11.010_br0020
  article-title: A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooksʼ theorem
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(95)00082-8
– year: 1979
  ident: 10.1016/j.ipl.2011.11.010_br0030
– volume: 1
  start-page: 237
  year: 1976
  ident: 10.1016/j.ipl.2011.11.010_br0040
  article-title: Some simplified NP-complete graph problems
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(76)90059-1
– volume: 32
  start-page: 1128
  year: 2003
  ident: 10.1016/j.ipl.2011.11.010_br0060
  article-title: The 3-colorability problem on graphs with maximum degree four
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539702418759
SSID ssj0006437
Score 1.9280772
Snippet The well-known Brooksʼ Theorem says that each graph G of maximum degree k ⩾ 3 is k-colorable unless G = K k + 1 . We generalize this theorem by allowing higher...
The well-known Brooks' Theorem says that each graph G of maximum degree k 3 is k-colorable unless G=Kk+1. We generalize this theorem by allowing higher degree...
The well-known Brooks' Theorem says that each graph G of maximum degree k>=3 is k-colorable unless G=Kk+1. We generalize this theorem by allowing higher degree...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 200
SubjectTerms [formula omitted]-dart graph
[formula omitted]-diamond
Brooksʼ Theorem
Graph algorithms
Graph coloring
Graphs
Mathematical programming
NP-complete problem
Studies
Theorems
Title Brooksʼ Theorem for generalized dart graphs
URI https://dx.doi.org/10.1016/j.ipl.2011.11.010
https://www.proquest.com/docview/915652088
https://www.proquest.com/docview/1010899771
Volume 112
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: ACRLP
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ]
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIKHN
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Science Direct
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AKRWK
  dateStart: 19930125
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwEB1V5cKFHVEKlZE4IUJTZ3F9rCqqAqInKvVmxY6DypJWpL1w4Mv4Ar6KmSxFIMSBYxZnebHHM5k3zwCnscZZJpbouVmLAUrciR0Zce3wMPIDk0ShtvS_43YUDsf-9SSY1KBf1cIQrbK0_YVNz611uaddotmeT6dU40t8IJmLnnkYJ1AFuy9oFYOLty-aByWmCpoHEbDkKrOZc7ym86dCxZOEPKmI9ve56YeVzqeewRZslD4j6xWPtQ01m-7AZrUeAyuH5y6cY0w9e8w-3llecW-fGXqk7L4Qlp6-2pjF-Gos16jO9mA8uLzrD51yNQTHeK5cOF2MDHzbQf_A9USSRIkxhnJRiXQRbFLBFxh8CNOl1GvomiiwXGjrBUJ3dYin7kM9naX2AFhiuUttQ2GNLzw8HGlEgXPJBQnEN-CswkHNC9ELVbHBHhSCpgg0DB4UgtYAv0JKfftyCo3yX82aFaqqHDaZkhhNBhwNXwNOVkexv1MSI0rtbJnR1ShTKUTn8H83bsI6bvGiLP0I6ouXpT1Gx2KhW3nPacFa7-pmOPoEyC_KUw
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwEB2VcoALO6KUJUicEIHUWVwfUUVVoO2plXqzYsdBYUkr2l448GV8AV_FTJYiEOLANY6zvNjjeZmZZ4DTSOEqEwn03IxBghI1IluETNksCD1fx2GgDP3v6PWDztC7HfmjCrTKWhhKqyxsf27TM2tdHLks0LycJAnV-FI-kMhEz1zkCUuw7PmMEwO7ePvK86DIVJ7nQRlYYhHazJK8kslTLuNJSp5URfv74vTDTGdrT3sD1gqn0brKn2sTKibdgvVyQwarmJ_bcI6kevw4_Xi3spJ782yhS2rd58rSyauJrAjfzcpEqqc7MGxfD1odu9gOwdauI2Z2E6mBZxroIDguj-Mw1lpTMCoWDqJNMvgc2QfXTYq9Bo4OfcO4Mq7PVVMFeOouVNNxavbAig1zqG_Ajfa4i82hQhQYE4yTQnwNzkoc5CRXvZBlOtiDRNAkgYbsQSJoNfBKpOS3TyfRKv_VrV6iKot5M5UC6aTP0PLV4GTRigOeohhhasbzKV2NQpWcN_b_d-NjWOkMel3Zvenf1WEVW1heo34A1dnL3ByilzFTR9ko-gSujsvo
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=Brooks%CA%BC+Theorem+for+generalized+dart+graphs&rft.jtitle=Information+processing+letters&rft.au=Kochol%2C+Martin&rft.au=%C5%A0krekovski%2C+Riste&rft.date=2012-02-28&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=112&rft.issue=5&rft.spage=200&rft.epage=204&rft_id=info:doi/10.1016%2Fj.ipl.2011.11.010&rft.externalDocID=S0020019011003140
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon