An Oriented Version of the 1-2-3 Conjecture
暂无分享,去创建一个
[1] Bruce A. Reed,et al. Vertex colouring edge partitions , 2005, J. Comb. Theory B.
[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[3] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .
[4] K. N. Dollman,et al. - 1 , 1743 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Jaroslaw Grytczuk,et al. Coloring chip configurations on graphs and digraphs , 2012, Inf. Process. Lett..
[7] Ben Seamone,et al. The 1-2-3 Conjecture and related problems: a survey , 2012, ArXiv.
[8] Florian Pfender,et al. Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture , 2010, J. Comb. Theory B.
[9] Klaudia Frankfurter. Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .
[10] Tomasz Bartnicki,et al. The n-ordered graphs: A new graph class , 2009 .
[11] A. Thomason,et al. Edge weights and vertex colours , 2004 .
[12] Joanna Skowronek-Kaziów. 1, 2 Conjecture - the multiplicative version , 2008, Inf. Process. Lett..
[13] Brett Stevens,et al. Digraphs are 2-Weight Choosable , 2011, Electron. J. Comb..
[14] Jakub Przybylo,et al. On decomposing regular graphs into locally irregular subgraphs , 2015, Eur. J. Comb..
[15] J. Moon. Topics on tournaments , 1968 .