540 search results - page 48 / 108 » New bounds on the edge number of a k-map graph |
ENDM
2007
13 years 8 months ago
2007
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
DM
2002
13 years 8 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
DM
2008
13 years 9 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
COR
2008
13 years 9 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...