Mohammad Reza Farahani

4 Questions 2 Answers 0 Followers

Questions related from Mohammad Reza Farahani

Every graph G=(V,E) has a coloring chip conguration c : V ∪ E → {1; 2}?

Conjecture 4. (The 1,2-conjecture [10, 14, 15]) Every graph G=(V,E)has a coloring chip conguration c : V∪ E −→ {1; 2}.

01 January 1970 6,241 0 View

There are the X(G) numbers of Sv's, v ∈ V (G), with this 1-2-3-edge labeling and vertex Coloring?

Conjecture 3.(Proper vertex coloring, [3]) For all graph G of ordern, there are the X(G) numbers of Sv's, v ∈ V (G), with this 1-2-3-edgelabeling and vertex Coloring. Where X(G) is the number...

01 January 1970 983 0 View

There are distinct numbers of Sv's, v ∈ V (G), of a graph G of order n, for a 1-2-3-edge labeling and vertex coloring?

There are distinct numbers of Sv's, v ∈ V (G), of a graph G of order n, for a 1-2-3-edge labeling and vertex coloring.

01 January 1970 9,376 0 View

Every connected graph G=(V;E) non-isomorph to K2 (with at least two edges) has an edge labeling f:E→{1; 2; 3} and vertex coloring S:V→ {n−1;...,3n−3}?

01 January 1970 1,339 0 View

Mohammad Reza Farahani

Every graph G=(V,E) has a coloring chip con guration c : V ∪ E → {1; 2}?

There are the X(G) numbers of Sv's, v ∈ V (G), with this 1-2-3-edge labeling and vertex Coloring?

There are distinct numbers of Sv's, v ∈ V (G), of a graph G of order n, for a 1-2-3-edge labeling and vertex coloring?

Every connected graph G=(V;E) non-isomorph to K2 (with at least two edges) has an edge labeling f:E→{1; 2; 3} and vertex coloring S:V→ {n−1;...,3n−3}?

Every graph G=(V,E) has a coloring chip conguration c : V ∪ E → {1; 2}?