253 search results - page 14 / 51 » Perfection thickness of graphs |
COMBINATORICS
2000
13 years 8 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
GD
2007
Springer
14 years 2 months ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
JCO
2000
13 years 8 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
ENDM
2008
13 years 8 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...