On $k$-Thin Sets and $n$-Extensive Graphs

Štefan Znám

Displaying similar documents to “On $k$ -Thin Sets and $n$ -Extensive Graphs”

Acyclic, star and oriented colourings of graph subdivisions.

Wood, David R. (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

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...