A note on embedding and generating dual polar spaces.
A note on embedding hypertrees.
A note on exponents vs root heights for complex simple Lie algebras.
A note on face coloring entire weightings of plane graphs
Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _. Such an entire weighting is a proper face colouring provided that f(α) ≠ f(β) for every two faces α and _ sharing an edge. We show that for every 2-connected plane graph there is a proper face-colouring entire weighting with weights 1 through 4. For some families we improved 4 to 3
A Note on Generalized Line Graphs
A note on graph coloring
A note on graph coloring extensions and list-colorings.
A note on graph colouring
A Note On Graphs Representable As Product Graphs
A note on graphs with two main eigenvalues
A note on graphs without short even cycles.
A note on Hamiltonian cycles in generalized Halin graphs
We show that every 2-connected (2)-Halin graph is Hamiltonian.
A note on indecomposability of Boolean matrices
A note on inequivalent Hadamard series.
A note on intersecting graphs.
A note on intersection dimensions of graph classes
The intersection dimension of a graph with respect to a class of graphs is the minimum such that is the intersection of some graphs on the vertex set belonging to . In this paper we follow [ Kratochv’ıl J., Tuza Z.: Intersection dimensions of graph classes, Graphs and Combinatorics 10 (1994), 159–168 ] and show that for some pairs of graph classes , the intersection dimension of graphs from with respect to is unbounded.
A note on Jeu de Taquin
A direct formula for jeu de taquin applied to the swap of two rows of standard tableaux is given. A generalization of this formula to non standard tableaux is used to describe combinatorially a path basis isomorphism for the algebra of type .
A note on joins of additive hereditary graph properties
Let denote a set of additive hereditary graph properties. It is a known fact that a partially ordered set is a complete distributive lattice. We present results when a join of two additive hereditary graph properties in has a finite or infinite family of minimal forbidden subgraphs.
A note on -cross free families.
A note on -free precolouring with colours.