967 resultados para 5-liter, Buesseler et al., 2000
Resumo:
Collection : Bibliothèque latine-française ; 1
Resumo:
Collection : Les Bons livres ; n° 76
La France en Tunisie / par MM. Marcel Dubois, Gaston Boissier, P. Gauckler, Dr Bertholon... [et al.]
Resumo:
The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cycle, where 3<=j<=5 if i=3 and 4<=j<=6 if i=4. We improve the above mentioned result and prove that every planar graph without an i-cycle adjacent to a j-cycle with3<=j<=5 if i=3 and 4<=j<=5 if i=4 is acyclically 5-choosable.
Resumo:
A summons to Henry Hoover of the Township of Thorold in the county of Welland, William Cowan of the Village of Dunville in the county of Haldimand, James Park and John H. Casper of the township of Thorold in the county of Welland.
Resumo:
Tesis (Maestría en Ciencias Odontológicas con Especialidad en Odontopedriatría) UANL, 2011.