EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 1101 – 1120 of 8549

Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view

Luis M. Torres, Annegret K. Wagler (2013)

RAIRO - Operations Research - Recherche Opérationnelle

To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.

Animals and 2-Motzkin paths.

Woan, Wen-jin (2005)

Journal of Integer Sequences [electronic only]

Announcements of new results

Mirko Navara (1992)

Commentationes Mathematicae Universitatis Carolinae

Another abstraction of the Erdős-Szekeres happy end theorem.

Alon, Noga, Chiniforooshan, Ehsan, Chvátal, Vašek, Genest, François (2010)

The Electronic Journal of Combinatorics [electronic only]

Another case of the prime power conjecture for finite projective planes.

Jungnickel, Dieter, de Resmini, Marialuisa J. (2002)

Advances in Geometry

Another characterisation of planar graphs.

Little, C.H.C., Sanjith, G. (2010)

The Electronic Journal of Combinatorics [electronic only]

Another class of equienergetic graphs

Harishchandra S. Ramane, Ivan Gutman, Hanumappa B. Walikar, Sabeena B. Halkarni (2004)

Kragujevac Journal of Mathematics

Another infinite sequence of dense triangle-free graphs.

Brandt, Stephan, Pisanski, Tomaž (1998)

The Electronic Journal of Combinatorics [electronic only]

Another interpretation of the number of derangements. (Une autre interprétation du nombre des dérangements.)

Désarménien, Jacques (1984)

Séminaire Lotharingien de Combinatoire [electronic only]

Another product construction for large sets of resolvable directed triple systems.

Zhao, Hongtao (2009)

The Electronic Journal of Combinatorics [electronic only]

Another Upper Bound For The Domination Number Of A Graph.

Danut Marcu (1986)

Revista colombiana de matematicas

Another way for associating a graph to a group

Alain Bretto, Alain Faisant (2005)

Mathematica Slovaca

Answer to one of Fishburn's questions: ``Isosceles planar subsets'' [Discrete Comput. Geom. 19 (1998), no. 3, 391--398]

Vojtech Bálint, Zuzana Kojdjaková (2001)

Archivum Mathematicum

Our short note gives the affirmative answer to one of Fishburn’s questions.

Antichains in the homomorphism order of graphs

Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)

Commentationes Mathematicae Universitatis Carolinae

Let $𝔾$ and $𝔻$ , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal antichains...

Antichains of multisets.

Kilibarda, Goran, Jovović, Vladeta (2004)

Journal of Integer Sequences [electronic only]

Antichains on three levels.

Lieby, Paulette (2004)

The Electronic Journal of Combinatorics [electronic only]

Antidirected Hamilton Circuits and Paths in Tournaments.

Carsten Thomassen (1973)

Mathematische Annalen

Antidomatic number of a graph.

Zelinka, Bohdan (1996)

Archivum Mathematicum

Antidomatic number of a graph

Bohdan Zelinka (1997)

Archivum Mathematicum

A subset $D$ of the vertex set $V (G)$ of a graph $G$ is called dominating in $G$ , if for each $x \in V (G) - D$ there exists $y \in D$ adjacent to $x$ . An antidomatic partition of $G$ is a partition of $V (G)$ , none of whose classes is a dominating set in $G$ . The minimum number of classes of an antidomatic partition of $G$ is the number $\bar{d} (G)$ of $G$ . Its properties are studied.

Antiflexible Latin directed triple systems

Andrew R. Kozlik (2015)

Commentationes Mathematicae Universitatis Carolinae

It is well known that given a Steiner triple system one can define a quasigroup operation $\cdot$ upon its base set by assigning $x \cdot x = x$ for all $x$ and $x \cdot y = z$ , where $z$ is the third point in the block containing the pair ${x, y}$ . The same can be done for Mendelsohn triple systems, where $(x, y)$ is considered to be ordered. But this is not necessarily the case for directed triple systems. However there do exist directed triple systems, which induce a quasigroup under this operation and these are called Latin directed triple systems....

Currently displaying 1101 – 1120 of 8549

Previous Page 56 Next