A reciprocity theorem for domino tilings.
Propp, James (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Goldberg-Coxeter construction for 3- and 4-valent plane graphs.”
A reciprocity theorem for domino tilings.
On -connected, planar -almost pancyclic graphs
Marián Trenkler (1989)
Mathematica Slovaca
Similarity:
An exploration of the permanent-determinant method.
Kuperberg, Greg (1998)
The Electronic Journal of Combinatorics [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...
Parity versions of 2-connectedness.
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The tau constant of a metrized graph and its behavior under graph operations.
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vector spaces and the Petersen graph.
de Carvalho, Marcelo H., Little, C.H.C. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Geometric thickness of complete graphs.
Dillencourt, Michael B., Eppstein, David, Hirschberg, Daniel S. (2000)
Journal of Graph Algorithms and Applications
Similarity:
The structure of plane graphs with independent crossings and its applications to coloring problems
Xin Zhang, Guizhen Liu (2013)
Open Mathematics
Similarity:
If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity...