Another infinite sequence of dense triangle-free graphs.
Another Upper Bound For The Domination Number Of A Graph.
Another way for associating a graph to a group
Antichains in the homomorphism order of graphs
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...
Antidirected Hamilton Circuits and Paths in Tournaments.
Antidomatic number of a graph.
Antidomatic number of a graph
A subset of the vertex set of a graph is called dominating in , if for each there exists adjacent to . An antidomatic partition of is a partition of , none of whose classes is a dominating set in . The minimum number of classes of an antidomatic partition of is the number of . Its properties are studied.
Antiflows, oriented and strong oriented colorings of graphs
We present an overview of the theory of nowhere zero flows, in particular the duality of flows and colorings, and the extension to antiflows and strong oriented colorings. As the main result, we find the asymptotic relation between oriented and strong oriented chromatic number.
Antineighbourhood graphs
Antipodal graphs and digraphs.
Anti-Ramsey numbers for graphs with independent cycles.
Anti-Ramsey numbers of spanning double stars.
Antisymmetric flows and strong colourings of oriented graphs
The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic colouring number and oriented chromatic number, have been recently intensely studied. For the purpose of duality, we define the notions of strong-oriented colouring and antisymmetric-flow. An antisymmetric-flow is a flow with values in an additive abelian group which uses no opposite elements of the group. We prove that the strong-oriented chromatic number (as the modular version...
Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster models.
Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avaries
Application de l'algèbre de Boole à l'étude des graphes
Applications des entiers à diviseurs denses
Applications harmoniques entre graphes finis et un théorème de superrigidité
Applications harmoniques entre graphes finis et un théorème de superrigidité
Nous définissons une ntoion d’énergie pour des applications entre deux graphes métriques finis et cherchons à minimiser l’énergie au sein d’une classe d’homotopie. Nous démontrons des théorèmes d’existence et d’unicité analogues à ceux de Eells-Sampson et de Hartman pour les applications harmoniques à valeurs dans les variétés à courbure négative ou nulle. Nous montrons également une propriété de stabilité des applications minimisantes par rapport aux revêtements de degré fini à la source. Une application...
Applications of combinatorics to statics – a survey