Displaying similar documents to “Symmetric bowtie decompositions of the complete graph.”

Rectangular table negotiation problem revisited

Dalibor Froncek, Michael Kubesa (2011)

Open Mathematics

Similarity:

We solve the last missing case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Suppose we have two negotiating delegations with n=mk members each and we have a seating arrangement such that every day the negotiators sit at m tables with k people of the same delegation at one side of each table. Every person can effectively communicate just with three nearest persons across the table. Our goal is to guarantee that over the course of...

Distinguishing maps.

Tucker, Thomas W. (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A combinatorial approach to singularities of normal surfaces

Sandro Manfredini (2003)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this paper we study generic coverings of ℂ 2 branched over a curve s.t. the total space is a normal analytic surface, in terms of a graph representing the monodromy of the covering, called monodromy graph. A complete description of the monodromy graphs and of the local fundamental groups is found in case the branch curve is { x n = y m } (with n ≤ m ) and the degree of the cover is equal to n or n - 1 .

Symmetry breaking in graphs.

Albertson, Michael O., Collins, Karen L. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity: