Results 41 to 50 of about 2,506 (162)
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Construcción de viviendas de módulos hexagonales
Informes de la Construccion, 1975 Se describe en el artículo el origen creacional de este sistema de prefabricación con piezas de hormigón armado, basado en la adecuada combinación de proporciones matemáticas; con definición de todas y cada una de las piezas que intervienen en la ...
Equipo Editorial
doaj +1 more source
Journal of Combinatorial Designs, EarlyView.ABSTRACT Capsets are subsets of F 3 n ${{\mathbb{F}}}_{3}^{n}$ with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3 ${{\mathbb{F}}}_{3}$.
Cassie Grace, José Felipe Voloch
wiley +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Gestão & Produção, 2008 O projeto de arranjo físico modular tem como base o agrupamento de máquinas em módulos a partir de subseqüências de operações comuns a um conjunto de peças.
Ana Rita Tiradentes Terra Argoud +2 more
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
A natureza das interações verbais durante visitas de estudo à seção de ótica de um museu de ciência
Revista Brasileira de Pesquisa em Educação em Ciências, 2015 Este estudo, levado a cabo num museu de ciência, procurou analisar a natureza dos diálogos entre pares, designadamente o que revelam quanto à forma como os alunos processam a informação, e qual a influência no envolvimento dos alunos quando se verifica a
Francisco Manuel Estanislau de Azevedo Rodrigues +1 more
doaj
Avaliação econômica de técnicas de recuperação de pastagens
Pesquisa Agropecuária Brasileira, 1999 O objetivo deste trabalho foi comparar a economicidade de algumas técnicas de recuperação de pastagens, ao longo de um período, avaliando o desempenho animal sob pastejo rotacionado.
Lidia Pacheco Yokoyama +4 more
doaj +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Four‐Dimensional pp‐Wave Lie Groups and Harmonic Curvature
Mathematische Nachrichten, EarlyView.ABSTRACT We determine all four‐dimensional Lie groups which have harmonic curvature. In parallel, a description of four‐dimensional pp‐wave Lie groups is obtained.
E. García‐Río +2 more
wiley +1 more source