共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
Jakub Przybyło 《Discrete Mathematics》2019,342(2):498-504
Let be any graph without isolated edges. The well known 1–2–3 Conjecture asserts that the edges of can be weighted with so that adjacent vertices have distinct weighted degrees, i.e. the sums of their incident weights. It was independently conjectured that if additionally has no isolated triangles, then it can be edge decomposed into two subgraphs which fulfil the 1–2–3 Conjecture with just weights 1,2, i.e. such that there exist weightings so that for every , if then , where denotes the sum of weights incident with in for . We apply the probabilistic method to prove that the known weakening of this so-called Standard (2,2)-Conjecture holds for graphs with minimum degree large enough. Namely, we prove that if , then can be decomposed into graphs for which weightings exist so that for every , or . In fact we prove a stronger result, as one of the weightings is redundant, i.e. uses just weight 1. 相似文献
7.
8.
9.
The tensor product of graphs , and is defined by and Let be the fractional chromatic number of a graph . In this paper, we prove that if one of the three graphs , and is a circular clique, 相似文献
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.