Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DM
2010

favoriteEmaildiscussreport

98views more DM 2010»

Idomatic partitions of direct products of complete graphs

13 years 4 months ago

Idomatic partitions of direct products of complete graphs

Download www-lipn.univ-paris13.fr

In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order to construct idomatic partitions of the direct product of finitely many complete graphs.

Mario Valencia-Pabon

Real-time Traffic

Complete Graphs | Direct Product | DM 2010 | Idomatic Partitions |

claim paper

Related Content

» SumProduct Networks A New Deep Architecture

» Partitions of Complete Geometric Graphs into Plane Trees

» Minimum cycle bases of direct products of complete graphs

» Directed Random Dot Product Graphs

» Dynamic Tree Cross Products

» Homogeneous factorisations of graph products

» Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems

» Fractional Biclique Covers and Partitions of Graphs

» Optimal Elections in Faulty Loop Networks and Applications

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DM
Authors	Mario Valencia-Pabon

Comments (0)