Search Sciweavers | Sciweavers

383 search results - page 4 / 77

» A Bound on the Total Chromatic Number

click to vote

COLOGNETWENTE
2009

97views Optimization» more COLOGNETWENTE 2009»

Two Upper Bounds on the Chromatic Number

13 years 8 months ago

Download www-labsticc.univ-ubs.fr

María Soto, André Rossi, Marc Sevaux

claim paper

Read More »

click to vote

ALGORITHMICA
2004

150views more ALGORITHMICA 2004»

Sum Coloring of Bipartite Graphs with Bounded Degree

13 years 7 months ago

Download www.eti.pg.gda.pl

We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...

Michal Malafiejski, Krzysztof Giaro, Robert Jancze...

claim paper

Read More »

click to vote

DM
2006

79views more DM 2006»

Conditional colorings of graphs

13 years 7 months ago

Download www.math.wvu.edu

For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...

Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...

claim paper

Read More »

click to vote

ANTS
2008
Springer

83views Algorithms» more ANTS 2008»

Enumeration of Totally Real Number Fields of Bounded Root Discriminant

13 years 9 months ago

Download www.cems.uvm.edu

We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...

John Voight

claim paper

Read More »

click to vote

COMBINATORICS
2007

84views more COMBINATORICS 2007»

A New Upper Bound on the Total Domination Number of a Graph

13 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers