121 search results - page 18 / 25 » dm 2010 |
DM
2010
13 years 10 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
DM
2010
13 years 10 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
DM
2010
13 years 10 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
DM
2010
13 years 10 months ago
2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...
TEC
2010
13 years 4 months ago
2010
The centrality of the decision maker (DM) is widely recognized in the multiple criteria decision-making community. This translates into emphasis on seamless human