Sciweavers

51 search results - page 6 / 11
» jgt 2006
Sort
View
JGT
2010
93views more  JGT 2010»
13 years 5 months ago
An asymptotic version of a conjecture by Enomoto and Ota
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Colton Magnant, Daniel M. Martin
JGT
2010
113views more  JGT 2010»
13 years 5 months ago
Coloring plane graphs with independent crossings
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether...
Daniel Král', Ladislav Stacho
JGT
2010
79views more  JGT 2010»
13 years 5 months ago
On Ramsey-type positional games
Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding ...
Jaroslav Nesetril, Tomás Valla
JGT
2006
97views more  JGT 2006»
13 years 7 months ago
Matchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
Daniela Kühn, Deryk Osthus
JGT
2010
89views more  JGT 2010»
13 years 5 months ago
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
Zdenek Dvorak, Daniel Král', Riste Skrekovs...