Tight bounds for the N2-chromatic number of graphs

Arnold A. Eniego; I. J.L. Garces; Jose B. Rosario

doi:10.22199/issn.0717-6279-6117

Tight bounds for the N₂-chromatic number of graphs

Arnold A. Eniego, I. J.L. Garces, Jose B. Rosario

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	247-263
Number of pages	17
Journal	Proyecciones
Volume	43
Issue number	1
DOIs	https://doi.org/10.22199/issn.0717-6279-6117
State	Published - Feb 2024

ASJC Scopus Subject Areas

General Mathematics

Keywords

N-chromatic number
N-vertex coloring
Vertex coloring
diameter
maximum degree

Access to Document

10.22199/issn.0717-6279-6117

Cite this

@article{88bd903708a04e4b9d6da82a9928c036,

title = "Tight bounds for the N2-chromatic number of graphs",

keywords = "N-chromatic number, N-vertex coloring, Vertex coloring, diameter, maximum degree",

author = "Eniego, \{Arnold A.\} and Garces, \{I. J.L.\} and Rosario, \{Jose B.\}",

year = "2024",

month = feb,

doi = "10.22199/issn.0717-6279-6117",

language = "English",

volume = "43",

pages = "247--263",

journal = "Proyecciones",

issn = "0716-0917",

publisher = "Universidad Catolica del Norte",

number = "1",

}

TY - JOUR

T1 - Tight bounds for the N2-chromatic number of graphs

AU - Eniego, Arnold A.

AU - Garces, I. J.L.

AU - Rosario, Jose B.

PY - 2024/2

Y1 - 2024/2

KW - N-chromatic number

KW - N-vertex coloring

KW - Vertex coloring

KW - diameter

KW - maximum degree

UR - https://www.scopus.com/pages/publications/85201912532

UR - https://www.scopus.com/inward/citedby.url?scp=85201912532&partnerID=8YFLogxK

U2 - 10.22199/issn.0717-6279-6117

DO - 10.22199/issn.0717-6279-6117

M3 - Article

AN - SCOPUS:85201912532

SN - 0716-0917

VL - 43

SP - 247

EP - 263

JO - Proyecciones

JF - Proyecciones

IS - 1

ER -

Tight bounds for the N₂-chromatic number of graphs

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this