Search results for "Crete"
showing 10 items of 2495 documents
Coding Partitions
2007
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguous component and other (if any) totally ambiguous components. In the case the code is finite, we give an algorithm for computing its canonical…
A Note on Radio Antipodal Colouring of Paths
2005
International audience; The radio antipodal number of a graph G is the smallest integer c such that there exists an assignment f : V (G) -> {1, 2, . . . , c} satisfying |f(u) − f(v)| >= D − d(u, v) for every two distinct vertices u and v of G, where D is the diameter of G. In this note we determine the exact value of the antipodal number of the path, thus answering the conjecture given in [G. Chartrand, D. Erwin, and P. Zhang. Radio antipodal colorings of graphs, Math. Bohem. 127(1):57-69, 2002]. We also show the connections between this colouring and radio labelings.
Grundy coloring for power caterpillars
2003
International audience
Adjacent vertex distinguishing edge-colorings of meshes and hypercubes
2006
International audience
Packing of two copies of a caterpillar into its third power
2003
International audience
Deux algorithmes d'intersection des surfaces de subdivision
2002
National audience
Squelettisation des objets 3D par des projections
2003
National audience
Feedback vertex set for distance and circulant graphs
2002
National audience
Force d'irrégularité des graphes circulants
2003
National audience
Grundy numbers of powers of graphs
2006
International audience