Graphs with maximum degree ∆ ≥ 17 and maximum average degree less than 3 are list 2-distance

We show an upper bound for the maximum vertex degree of any z-oblique graph imbedded into a given surface.. Moreover, an upper bound for the maximum face degree

D’une part, l’élevage y fut un phénomène très marginal et les seules espèces animales domestiquées à des fins alimentaires furent le dindon et le chien (les textes

By triple puncturing of the dodecacode, we obtain an additive code of length 9, and taking its coset graph, we construct a strongly regular graph of parameters ( 64 , 27 , 10 , 12

Ces résultats peuvent être interprétés de plu‑ sieurs manières : d’abord ils pourraient reflé‑ ter les biais de déclaration dans la variable de santé subjective

[1] proved that asymptotically every graph with maximum degree ∆ is acyclically colorable with O(∆ 4/3 ) colors; moreover they exhib- ited graphs with maximum degree ∆ with

If P does not end with v, then we can exchange the colors α and γ on this path leading to a δ-improper edge coloring such that the color γ is missing in u and v.. The color γ could

To further characterize the ligand binding mode, we used Microscale Thermophoresis to determine the affinity of ENDO-WT and mutants ENDO-D88A and ENDO-D118A for DPBA (1) and

As the main contribution of this paper, we establish that BP converges to the optimal solution of a min-cost network flow problem in the pseudo-polynomial time, provided that