نتایج جستجو برای: locating chromatic number
تعداد نتایج: 1185149 فیلتر نتایج به سال:
Journal:
:Missouri Journal of Mathematical Sciences
2008
Journal:
:Journal of Combinatorial Theory, Series B
2005
Journal:
:Journal of Graph Algorithms and Applications
2017
Journal:
:Journal of Combinatorial Theory, Series B
2023
The proper orientation number χ→(G) of a graph G is the minimum k such that there exists an edges with all vertex-outdegrees at most and for any adjacent vertices, outdegrees are different. Two major conjectures about resolved. First it shown, planar 14. Secondly, shown every graph, , where r=χ(G) usual chromatic maximum average degree taken over subgraphs G. Several other related results deriv...
Journal:
:Journal of Combinatorial Theory, Series A
1978
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید