Volume 102; Issue 1

1

Clique or hole in claw-free graphs

Year:
2012
Language:
english
File:
PDF, 232 KB
english, 2012
2

Bandwidth theorem for random graphs

Year:
2012
Language:
english
File:
PDF, 381 KB
english, 2012
3

Decomposing a graph into forests

Year:
2012
Language:
english
File:
PDF, 232 KB
english, 2012
5

Polyhedra with the Integer Carathéodory Property

Year:
2012
Language:
english
File:
PDF, 165 KB
english, 2012
6

Clique minors in claw-free graphs

Year:
2012
Language:
english
File:
PDF, 301 KB
english, 2012
8

Tournament immersion and cutwidth

Year:
2012
Language:
english
File:
PDF, 168 KB
english, 2012
10

Δ-Critical graphs with small high vertex cliques

Year:
2012
Language:
english
File:
PDF, 136 KB
english, 2012
11

Finite dualities and map-critical graphs on a fixed surface

Year:
2012
Language:
english
File:
PDF, 514 KB
english, 2012
12

Combinatorial optimization with 2-joins

Year:
2012
Language:
english
File:
PDF, 417 KB
english, 2012
13

Packing of Steiner trees and S-connectors in graphs

Year:
2012
Language:
english
File:
PDF, 323 KB
english, 2012
14

On the maximum size of a minimal k-edge connected augmentation

Year:
2012
Language:
english
File:
PDF, 145 KB
english, 2012
15

Partitioning 3-uniform hypergraphs

Year:
2012
Language:
english
File:
PDF, 291 KB
english, 2012
16

The structure of bull-free graphs II and III—A summary

Year:
2012
Language:
english
File:
PDF, 377 KB
english, 2012
18

Editorial Board

Year:
2012
Language:
english
File:
PDF, 30 KB
english, 2012