• Aucun résultat trouvé

[PDF] Top 20 Further Results on an Equitable 1-2-3 Conjecture

Has 10000 "Further Results on an Equitable 1-2-3 Conjecture" found on our website. Below are the top 20 most common "Further Results on an Equitable 1-2-3 Conjecture".

Further Results on an Equitable 1-2-3 Conjecture

Further Results on an Equitable 1-2-3 Conjecture

... consider equitable proper labellings of graphs, which were recently intro- duced by Baudon, Pilśniak, Przybyło, Senhaji, Sopena, and ...that 1) no two adjacent vertices are incident to the same sum of ... Voir le document complet

28

Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture

Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture

... Keywords: 123 Conjecture, locally irregular graph, graph decomposition ...least 2 cannot be irregular, ...that an irregular multigraph can be obtained from a given graph G by ... Voir le document complet

14

A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs

A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs

... the 1-2-3 Conjecture in 5-regular ...the 1-2-3 ...+ 1 (Karoński, Łuczak, Thomason [8]) or χ(G) = 4k (Duan, Lu, Yu [3]), where χ refers to the usual chromatic ... Voir le document complet

15

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture

... with an |E(G)| + k bound on χ e,1 Σ (G), for any constant ...these results can be used in order to show that nice subcubic graphs agree with Conjecture ... Voir le document complet

18

On a List Variant of the Multiplicative 1-2-3 Conjecture

On a List Variant of the Multiplicative 1-2-3 Conjecture

... The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with 1, 2, 3 so that no two adjacent vertices are incident to the same sum of ...List ... Voir le document complet

24

Going Wide with the 1-2-3 Conjecture

Going Wide with the 1-2-3 Conjecture

... Despite being a promising approach, we do not seem to deduce anything particular from, notably, the results on proper labellings of hypergraphs from [5]. The main reason for that, being that, given a graph G, the ... Voir le document complet

27

1-2-3 Conjecture in Digraphs: More Results and Directions

1-2-3 Conjecture in Digraphs: More Results and Directions

... + 1}-arc-weighting of D, we proceed as ...by an ss-arc, using Theorem 2.5 we can deduce (−, +)-distinguishing 3-arc-weighting of D 0 where the only conflicts are along arcs − uv such that u is a ... Voir le document complet

22

Further Evidence Towards the Multiplicative 1-2-3 Conjecture

Further Evidence Towards the Multiplicative 1-2-3 Conjecture

... Keywords: 1-2-3 Conjecture; multiset version; product version; 4-chromatic ...given an undirected graph, is to label its edges so that its adjacent vertices get distinguished by some ... Voir le document complet

16

Prediction of a New Layered Polymorph of FeS 2 with Fe 3+ S 2– (S 2  ) 1/2 2- Structure

Prediction of a New Layered Polymorph of FeS 2 with Fe 3+ S 2– (S 2 ) 1/2 2- Structure

... S 2 2- dimers are arranged around the Fe 2+ c T c c - b 1 f 1 ) 26 1 1 ) 26 for marcasite ...experimental results are as low as 0.5% (159.6 3 1 ... Voir le document complet

22

Continuum limit of the integrable $sl(2/1)_{3-\bar{3}}$ superspin chain

Continuum limit of the integrable $sl(2/1)_{3-\bar{3}}$ superspin chain

... [b, 1/2] while we initially expected a discrete one [−n + 1/2, ...is an artifact from the (rather uncontrolled) regularization at ... Voir le document complet

50

brochure cycle 4 maths 2019 1 1 d course conjecture

brochure cycle 4 maths 2019 1 1 d course conjecture

... Exercice proposé à réaliser en travail de groupe comme exercice de révision éventuellement ABC est un triangle isocèle de sommet principal A. Le cercle de diamètre [AC] recoupe le segment [BC] en D et la droite (BA) en ... Voir le document complet

4

Weighted coloring: further complexity and approximability results

Weighted coloring: further complexity and approximability results

... Theorem 1 Weighted Coloring is strongly NP-hard in interval graphs. Moreover, the problem of finding χ(G, w) is also NP-hard in interval graphs. Proof. We reduce the Circular Arc Coloring problem to our problem. A ... Voir le document complet

11

Fin de la Preuve de la Conjecture du Jacobien en dimension 2

Fin de la Preuve de la Conjecture du Jacobien en dimension 2

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

2

On a directed variation of the 1-2-3 and 1-2 Conjectures

On a directed variation of the 1-2-3 and 1-2 Conjectures

... well-known 1-2-3 Conjecture: Given any digraph D with no arc − uv verifying d → + (u) = d − (v) = 1, is it possible to weight the arcs of D with weights among {1, 2, ... Voir le document complet

14

(4S)-4-Benzyl-N-{[(4S)-4-benzyl-2-oxo-1, 3-oxazolidin-3-yl] sulfonyl}-2-oxo-1, 3-oxazolidine-3-carboxamide

(4S)-4-Benzyl-N-{[(4S)-4-benzyl-2-oxo-1, 3-oxazolidin-3-yl] sulfonyl}-2-oxo-1, 3-oxazolidine-3-carboxamide

... dropwise 1 equivalent of -hydroxyester (1.34 g, 11.4 mmol) in 5 ml of the same of solvent. After 30 min, the carbamate was added to a solution of oxazolidinine (2.01 g, 11.4 mmol), in presence of 1.1 equivalent of ... Voir le document complet

11

The demand for electricity: comment and further results

The demand for electricity: comment and further results

... However, the estimated income elasticity using average ex post electricity price (0.786) is considerably smaller than the 1.041 - 1.165 income elasticity estimates using margin[r] ... Voir le document complet

27

Weighted coloring: further complexity and approximability results

Weighted coloring: further complexity and approximability results

... − 3/k)-approximation algorithm in hereditary classes of k-colorable graphs where the usual coloring problem is ...− 3/∆)-approximation algorithm for line graphs of bipartite graphs with maximum degree ... Voir le document complet

10

un partage equitable ts

un partage equitable ts

... Énoncé élève Problème Un partage équitable... Dans le plan muni d’un repère orthogonal (O; − → i , → − j ), on considère la parabole d’équation y = −2x 2 + 4x. On considère également le domaine D du plan délimité ... Voir le document complet

6

Equitable $(d,m)$-edge designs

Equitable $(d,m)$-edge designs

... moment estimates using r samples of {d i (·)} d i=1 computed along r randomly oriented paths T d+1 along which each one of the d coordinates is changed at a time, see Figure 1. The total number of ... Voir le document complet

22

Lattice measurement of the Isgur-Wise functions $\tau_{1/2}$ and $\tau_{3/2}$

Lattice measurement of the Isgur-Wise functions $\tau_{1/2}$ and $\tau_{3/2}$

... 2 (1). We thus expect no multiplicative renor- malisation to be needed. A closer scrutiny of this question is underway, in particular to understand if the hypercubic treatment of the Wilson line can have ... Voir le document complet

13

Show all 10000 documents...