Tight bounds for the N₂-chromatic number of graphs
From MaRDI portal
Publication:6563257
DOI10.22199/ISSN.0717-6279-6117zbMATH Open1541.05058MaRDI QIDQ6563257FDOQ6563257
Authors: Arnold A. Eniego, Ian June L. Garces, Jose B. Rosario 
Publication date: 27 June 2024
Published in: Proyecciones (Search for Journal in Brave)
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
- Title not available (Why is that?)
- 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
- A graph and its complement with specified properties. III: Girth and circumference
- 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)
