On Neighbor-Distinguishing Index of Planar Graphs
暂无分享,去创建一个
[1] Keith Edwards,et al. On the Neighbour-Distinguishing Index of a Graph , 2006, Graphs Comb..
[2] Wei-Fan Wang,et al. Adjacent vertex-distinguishing edge colorings of K4-minor free graphs , 2011, Appl. Math. Lett..
[3] Hamed Hatami,et al. Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number , 2005, J. Comb. Theory, Ser. B.
[4] Hervé Hocquard,et al. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five , 2011, Electron. Notes Discret. Math..
[5] Hervé Hocquard,et al. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ , 2013, J. Comb. Optim..
[6] Olivier Togni,et al. Adjacent vertex distinguishing edge-colorings of meshes , 2006, Australas. J Comb..
[7] Wei-Fan Wang,et al. Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree , 2010, J. Comb. Optim..
[8] Richard H. Schelp,et al. Adjacent Vertex Distinguishing Edge-Colorings , 2007, SIAM J. Discret. Math..
[9] Jianfang Wang,et al. Adjacent strong edge coloring of graphs , 2002, Appl. Math. Lett..
[10] Andrzej Rucinski,et al. Neighbour-Distinguishing Edge Colourings of Random Regular Graphs , 2006, Electron. J. Comb..
[11] Mirko Hornák,et al. General neighbour-distinguishing index of a graph , 2008, Discret. Math..