Sciweavers

JGT
2007
55views more  JGT 2007»
13 years 11 months ago
Hamilton cycles in prisms
Tomás Kaiser, Zdenek Ryjácek, Daniel...
JGT
2007
73views more  JGT 2007»
13 years 11 months ago
Independence number and clique minors
Ken-ichi Kawarabayashi, Zi-Xia Song
JGT
2007
64views more  JGT 2007»
13 years 11 months ago
Interval Tournaments
David E. Brown, Arthur H. Busch, J. Richard Lundgr...
JGT
2007
85views more  JGT 2007»
13 years 11 months ago
On graphs with subgraphs having large independence numbers
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
Noga Alon, Benny Sudakov
JGT
2007
146views more  JGT 2007»
13 years 11 months ago
Compatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
Herbert Fleischner, François Genest, Bill J...
JGT
2007
43views more  JGT 2007»
13 years 11 months ago
Tripartite Ramsey numbers for paths
András Gyárfás, Miklós...
JGT
2007
81views more  JGT 2007»
13 years 11 months ago
Maximum directed cuts in acyclic digraphs
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a la...
Noga Alon, Béla Bollobás, Andr&aacut...
JGT
2007
68views more  JGT 2007»
13 years 11 months ago
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edwa...