SIAMDM 2008 - PDF Preprint Papers

SIAMDM 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMDM-2008 Paper

click to vote

SIAMDM
2008

190views more SIAMDM 2008»

On the Complexity of Ordered Colorings

14 years 11 days ago

Download www.pims.math.ca

We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...

Arvind Gupta, Jan van den Heuvel, Ján Manuc...

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	190	On the Complexity of Ordered Colorings	claim
2	154	On the First-Fit Chromatic Number of Graphs	claim
3	148	A New Algorithm for On-line Coloring Bipartite Graphs	claim
4	143	Coloring Bull-Free Perfectly Contractile Graphs	claim
5	140	Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice	claim
6	139	Approximate Integer Decompositions for Undirected Network Design Problems	claim
7	123	Adapted List Coloring of Graphs and Hypergraphs	claim
8	122	Cycle Systems in the Complete Bipartite Graph Plus a One-Factor	claim
9	119	Cubic Monomial Bent Functions: A Subclass of M	claim
10	119	On the Graph Bisection Cut Polytope	claim
11	118	Ramsey-Type Problem for an Almost Monochromatic K4	claim
12	115	Rank-Width and Well-Quasi-Ordering	claim
13	114	Split Hypergraphs	claim
14	113	Power Domination in Product Graphs	claim
15	111	On Cosets of Weight 4 of BCH(2m, 8), m Even, and Exponential Sums	claim
16	110	The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane	claim
17	105	Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups	claim
18	105	A Simple Linear Time LexBFS Cograph Recognition Algorithm	claim
19	101	Hamilton Cycles in Random Lifts of Directed Graphs	claim
20	101	On Planar Quasi-Parity Graphs	claim
21	100	Tree-Related Widths of Graphs and Hypergraphs	claim
22	99	Hat Guessing Games	claim
23	99	Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees	claim
24	97	Large Nearly Regular Induced Subgraphs	claim
25	97	Disjoint Color-Avoiding Triangles	claim
26	95	A Note On Reed's Conjecture	claim
27	95	A Census of Small Latin Hypercubes	claim
28	90	The Nine Morse Generic Tetrahedra	claim
29	90	Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction	claim
30	89	Planarity, Colorability, and Minor Games	claim
31	89	Integer Exact Network Synthesis Problem	claim
32	86	Hamilton Cycles in Planar Locally Finite Graphs	claim
33	85	On the Duals of Binary Hyper-Kloosterman Codes	claim
34	84	On k-Term DNF with the Largest Number of Prime Implicants	claim
35	84	Long Local Searches for Maximal Bipartite Subgraphs	claim
36	83	Combinatorial Properties of a Rooted Graph Polynomial	claim
37	81	Polychromatic Colorings of Subcubes of the Hypercube	claim
38	79	Testing Triangle-Freeness in General Graphs	claim
39	79	Reconfigurations in Graphs and Grids	claim
40	77	Cycles Intersecting Edge-Cuts of Prescribed Sizes	claim
41	77	The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra	claim
42	77	Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search	claim
43	77	Detecting a Theta or a Prism	claim
44	76	Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs	claim
45	72	Prolific Codes with the Identifiable Parent Property	claim
46	70	Near-Unanimity Functions and Varieties of Reflexive Graphs	claim
47	70	Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices	claim
48	69	Labeled Partitions and the q-Derangement Numbers	claim
49	63	Odd Minimum Cut Sets and b-Matchings Revisited	claim
50	62	l-Chain Profile Vectors	claim
51	61	Unit Circular-Arc Graph Representations and Feasible Circulations	claim
52	60	Explicit Construction of Small Folkman Graphs	claim
53	59	Walkers on the Cycle and the Grid	claim
54	53	Coloring of Triangle-Free Graphs on the Double Torus	claim
55	53	Graph-Different Permutations	claim
56	50	Real Number Channel Assignments for Lattices	claim
57	49	An Explicit Bound On Double Exponential Sums Related to Diffie--Hellman Distributions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers