Edge Grundy numbers of P₃ P_n and P₃ C_n.

zbMATH Open1397.05054MaRDI QIDQ2960909FDOQ2960909

Authors: Loren Anderson 

Publication date: 17 February 2017

Full work available at URL: http://ijmcs.future-in-tech.net/11.1/R-Anderson.pdf

Recommendations

• The edge Grundy numbers of some graphs
• The domination numbers of cylindrical grid graphs
• On the gracefulness of graph \(P_n^3\)
• Grundy number of graphs
• Edge domination in grids

zbMATH Keywords

gridline graphCartesian product of graphscycleGrundy numberpathproper coloringGrundy coloringHaskell code

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Uses Software

• Haskell

This page was built for publication: Edge Grundy numbers of \(P_3\square P_n\) and \(P_3\square C_n\).

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