CPC 2004 - PDF Preprint Papers

CPC 2004

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CPC-2004 Paper

click to vote

CPC
2004

136views more CPC 2004»

On the Strong Chromatic Number

14 years 17 days ago

Download orion.math.iastate.edu

The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...

Penny E. Haxell

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	136	On the Strong Chromatic Number	claim
2	98	And/Or Trees Revisited	claim
3	92	Large Topological Cliques in Graphs Without a 4-Cycle	claim
4	87	Quicksort with Unreliable Comparisons: A Probabilistic Analysis	claim
5	83	Embedding a Markov Chain into a Random Walk on a Permutation Group	claim
6	82	Boltzmann Samplers for the Random Generation of Combinatorial Structures	claim
7	76	On Some Parameters in Heap Ordered Trees	claim
8	76	Chromatic Roots are Dense in the Whole Complex Plane	claim
9	70	Random Assignment with Integer Costs	claim
10	69	New Bounds on Parent-Identifying Codes: The Case of Multiple Parents	claim
11	68	Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs	claim
12	66	Two Results on Real Zeros of Chromatic Polynomials	claim
13	65	On the b-Independence Number of Sparse Random Graphs	claim
14	65	Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety	claim
15	62	Optimizing LRU Caching for Variable Document Sizes	claim
16	59	Max Cut for Random Graphs with a Planted Partition	claim
17	51	A Note on a Question of Erdos and Graham	claim
18	49	Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm	claim
19	46	Threshold Functions for Random Graphs on a Line Segment	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers