scientific article; zbMATH DE number 6453552

DOI10.11672/DBSDZK2014-03-009zbMATH Open1324.05062MaRDI QIDQ5260143FDOQ5260143

Authors

Publication date 29 June 2015

zbMATH Keywords

grid graphsadjacent vertex-distinguishing proper edge chromatic numberadjacent vertex-distinguishing proper edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Adjacent vertex-distinguishing edge colorings of a class of two dimensional generalized grid graphs generated by complete graphs
• Adjacent vertex-distinguishing total colorings of a class of two dimensional generalized grid graphs
• On the adjacent vertex distinguishing edge colourings of graphs
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
• Vertex-edge adjacent vertex-distinguishing total colorings of some graphs
• Adjacent vertex-distinguishing edge coloring of graphs
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• On adjacent-vertex-distinguishing total coloring of graphs

Cited in

(4)

• Induced \(nK_2\) decomposition of infinite square grids and infinite hexagonal grids
• 2-edge-colored chromatic number of grids is at most 9
• Adjacent vertex-distinguishing edge colorings of a class of two dimensional generalized grid graphs generated by complete graphs
• Adjacent vertex-distinguishing total colorings of a class of two dimensional generalized grid graphs

This page was built for publication:

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