Tight bounds for the N₂-chromatic number of graphs

DOI10.22199/ISSN.0717-6279-6117MaRDI QIDQ6563257zbMATH OpenFDO

Authors Arnold A. Eniego, Ian June L. Garces, Jose B. Rosario

Publication date 27 June 2024

Published in Proyecciones (Search for Journal in Brave)

zbMATH Keywords

diametermaximum degreevertex coloring\(N_2\)-vertex coloring\(N_2\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On \(N_2\)-vertex coloring of graphs
• Neighborhood-restricted \([\leq 2]\)-achromatic colorings
• Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
• One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs
• New upper bounds for the chromatic number of a graph

Cites work

• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• A graph and its complement with specified properties. III: Girth and circumference
• Largest Graphs of Diameter 2 and Maximum Degree 6
• On \(N_2\)-vertex coloring of graphs
• \(M_2\)-edge coloring and maximum matching of graphs
• \(M_i\)-edge colorings of graphs
• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins

This page was built for publication: Tight bounds for the \(N_2\)-chromatic number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563257)