JCT 2008 | Sciweavers

Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...

James G. Oxley, Charles Semple, Geoff Whittle

claim paper

Read More »

22

click to vote

JCT
2008

76views more JCT 2008»

Bisimplicial vertices in even-hole-free graphs

13 years 10 months ago

Download www.columbia.edu

Louigi Addario-Berry, Maria Chudnovsky, Fré...

claim paper

Read More »

21

click to vote

JCT
2008

57views more JCT 2008»

k-Ordered Hamilton cycles in digraphs

13 years 10 months ago

Download web.mat.bham.ac.uk

Daniela Kühn, Deryk Osthus, Andrew Young

claim paper

Read More »

38

click to vote

JCT
2008

55views more JCT 2008»

Packing of graphs with small product of sizes

13 years 10 months ago

Download sitemason.vanderbilt.edu

Alexandr V. Kostochka, Gexin Yu

claim paper

Read More »

39

click to vote

JCT
2008

120views more JCT 2008»

Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs

13 years 10 months ago

Download www.cse.cuhk.edu.hk

Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...

Tamás Király, Lap Chi Lau

claim paper

Read More »

25

click to vote

JCT
2008

70views more JCT 2008»

Claw-free graphs. IV. Decomposition theorem

13 years 10 months ago

Download www.columbia.edu

Maria Chudnovsky, Paul D. Seymour

claim paper

Read More »

34

click to vote

JCT
2008

96views more JCT 2008»

Graphs with full rank 3-color matrix and few 3-colorings

13 years 10 months ago

Download www.math.princeton.edu

We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...

Serguei Norine, Jean-Sébastien Sereni

claim paper

Read More »

12

click to vote

JCT
2008

54views more JCT 2008»

Nowhere-zero 3-flows in triangularly connected graphs

13 years 10 months ago