On N₂-vertex coloring of graphs

DOI10.1142/S1793830918500076MaRDI QIDQ4603874zbMATH OpenFDO

Authors

Publication date 23 February 2018

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830918500076

zbMATH Keywords

\(N_2\)-vertex coloringgraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An improved bound on 2-distance coloring plane graphs with girth 5
• Vertex neighborhood restricted edge achromatic sums of graphs
• 2-distance coloring of planar graphs with girth 5
• On \(d_2\)-coloring of certain families of graphs
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)

Cites work

• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
• M₂-edge coloring and maximum matching of graphs
• M_i-edge colorings of graphs

Cited in

(7)

• On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
• On \(\mathrm{M}_f\)-edge colorings of graphs
• \(F\)-WORM colorings: results for 2-connected graphs
• scientific article; zbMATH DE number 1159270 (Why is no real title available?)
• Colorings of the Graph K ᵐ 2 + Kn
• Tight bounds for the N₂-chromatic number of graphs
• On the defining number of (2n-2)-vertex colorings of K_n K_n

This page was built for publication: On \(N_2\)-vertex coloring of graphs

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