Upper embeddable factorizations of graphs
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph is the minimum order of an oriented graph such that admits a homomorphism to . The oriented chromatic number of an undirected graph G is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph G, defined as the minimum order of an oriented graph such that every orientation of G admits a homomorphism to . We give some properties...
Upper signed total domination number of directed graphs
Upward embeddings and orientations of undirected planar graphs.
Upward planarization layout.
User's Guide to Equivariant Methods in Combinatorics
User's guide to equivariant methods in combinatorics. II.
Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.
Using determining sets to distinguish Kneser graphs.
Using graph layout to visualize train interconnection data.
Using homological duality in consecutive pattern avoidance.
Using Lovász local lemma in the space of random injections.
Using R to Build and Assess Network Models in Biology
In this paper we build and analyze networks using the statistical and programming environment R and the igraph package. We investigate random, small-world, and scale-free networks and test a standard problem of connectivity on a random graph. We then develop a method to study how vaccination can alter the structure of a disease transmission network. We also discuss a variety of other uses for networks in biology.
Using the Frattini subgroup and independent generating sets to study RWPri geometries.
Utilisation des scores dans des méthodes exactes déterminant les ordres médians de tournois
Dans cet article, nous utilisons un paramètre défini à partir des scores d’un tournoi pour déterminer les ordres médians de . Ce paramètre évalue un éloignement entre le tournoi et les tournois transitifs ayant le même nombre de sommets. Appelant le nombre minimum d’arcs à inverser pour rendre transitif, et le nombre de sommets de , nous proposons d’abord deux algorithmes linéaires en n calculant et un ordre médian de pour les tournois tels que soit égal à ou . Puis nous...
Užití kubiky při řešení jedné kombinatorické úlohy