Tight bounds for the \(N_2\)-chromatic number of graphs

DOI10.22199/ISSN.0717-6279-6117zbMATH Open1541.05058MaRDI QIDQ6563257

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

Publication date: 27 June 2024

Published in: Proyecciones (Search for Journal in Brave)

zbMATH Keywords

diametervertex coloringmaximum degree\(N_2\)-vertex coloring\(N_2\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
• A graph and its complement with specified properties. III: Girth and circumference
• \(M_2\)-edge coloring and maximum matching of graphs
• \(M_i\)-edge colorings of graphs
• On N2-vertex coloring of graphs
• Largest Graphs of Diameter 2 and Maximum Degree 6

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)