Sciweavers

3204 search results - page 62 / 641
» The Alcuin Number of a Graph
Sort
View
JGT
2010
89views more  JGT 2010»
13 years 6 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...
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 6 months ago
Deciding k-Colorability of P5-Free Graphs in Polynomial Time
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
Chính T. Hoàng, Marcin Kaminski, Vad...
ARSCOM
2002
70views more  ARSCOM 2002»
13 years 7 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
COMBINATORICS
1999
93views more  COMBINATORICS 1999»
13 years 7 months ago
Induced Complete h-partite Graphs in Dense Clique-less Graphs
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
Eldar Fischer
DM
1998
95views more  DM 1998»
13 years 7 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...