Volume 309; Issue 18

Discrete Mathematics

Volume 309; Issue 18
1

On perfect Lee codes

Year:
2009
Language:
english
File:
PDF, 890 KB
english, 2009
2

Edge-switching homomorphisms of edge-coloured graphs

Year:
2009
Language:
english
File:
PDF, 617 KB
english, 2009
3

Asymmetric directed graph coloring games

Year:
2009
Language:
english
File:
PDF, 333 KB
english, 2009
4

On -chromatically connected graphs

Year:
2009
Language:
english
File:
PDF, 338 KB
english, 2009
5

Colouring graphs with bounded generalized colouring number

Year:
2009
Language:
english
File:
PDF, 495 KB
english, 2009
6

Preface

Year:
2009
Language:
english
File:
PDF, 131 KB
english, 2009
8

The capture time of a graph

Year:
2009
Language:
english
File:
PDF, 544 KB
english, 2009
12

Linear coloring of planar graphs with large girth

Year:
2009
Language:
english
File:
PDF, 654 KB
english, 2009
13

Optimal gathering protocols on paths under interference constraints

Year:
2009
Language:
english
File:
PDF, 1.25 MB
english, 2009
14

A dynamic distributed approach to representing proper interval graphs

Year:
2009
Language:
english
File:
PDF, 494 KB
english, 2009
15

On the chromatic number of circulant graphs

Year:
2009
Language:
english
File:
PDF, 679 KB
english, 2009
16

A surprising permanence of old motivations (a not-so-rigid story)

Year:
2009
Language:
english
File:
PDF, 2.17 MB
english, 2009
17

Linear-time certifying algorithms for near-graphical sequences

Year:
2009
Language:
english
File:
PDF, 642 KB
english, 2009
18

Circuit double covers in special types of cubic graphs

Year:
2009
Language:
english
File:
PDF, 399 KB
english, 2009
19

A note on submodular set cover on matroids

Year:
2009
Language:
english
File:
PDF, 568 KB
english, 2009
20

Generating asymptotically optimal broadcasting schedules to minimize average waiting time

Year:
2009
Language:
english
File:
PDF, 824 KB
english, 2009
21

Sweeping graphs with large clique number

Year:
2009
Language:
english
File:
PDF, 960 KB
english, 2009
22

Spanning cubic graph designs

Year:
2009
Language:
english
File:
PDF, 953 KB
english, 2009
23

Homomorphisms of triangle-free graphs without a -minor

Year:
2009
Language:
english
File:
PDF, 689 KB
english, 2009
24

On complexity of round transformations

Year:
2009
Language:
english
File:
PDF, 590 KB
english, 2009
25

The good, the bad, and the great: Homomorphisms and cores of random graphs

Year:
2009
Language:
english
File:
PDF, 422 KB
english, 2009
26

Characterizations and recognition of circular-arc graphs and subclasses: A survey

Year:
2009
Language:
english
File:
PDF, 1.25 MB
english, 2009
27

Injective colorings of planar graphs with few colors

Year:
2009
Language:
english
File:
PDF, 945 KB
english, 2009
28

An algorithm for the number of path homomorphisms

Year:
2009
Language:
english
File:
PDF, 383 KB
english, 2009
30

Embeddings of -designs into bowtie and almost bowtie systems

Year:
2009
Language:
english
File:
PDF, 313 KB
english, 2009
31

On the complexity of -colouring planar graphs

Year:
2009
Language:
english
File:
PDF, 924 KB
english, 2009
32

Distance constrained labelings of -minor free graphs

Year:
2009
Language:
english
File:
PDF, 1.02 MB
english, 2009
33

Brambles and independent packings in chordal graphs

Year:
2009
Language:
english
File:
PDF, 320 KB
english, 2009
34

The circular chromatic number of hypergraphs

Year:
2009
Language:
english
File:
PDF, 556 KB
english, 2009