27 search results - page 1 / 6 » Claw-free graphs. I. Orientable prismatic graphs |
JCT
2007
13 years 4 months ago
2007
ENDM
2008
13 years 5 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
CATS
2008
13 years 6 months ago
2008
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
COMBINATORICS
1999
13 years 4 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
CATS
2006
13 years 6 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...