JGT 2006 - PDF Preprint Papers

JGT 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JGT-2006 Paper

click to vote

JGT
2006

114views more JGT 2006»

The chromatic covering number of a graph

13 years 6 months ago

Download www.math.carleton.ca

Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...

Reza Naserasr, Claude Tardif

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	114	The chromatic covering number of a graph	claim
2	101	Distinguishing geometric graphs	claim
3	99	On the circular chromatic number of circular partitionable graphs	claim
4	98	Group chromatic number of planar graphs of girth at least 4	claim
5	97	Matchings in hypergraphs of large minimum degree	claim
6	95	Maximal independent sets in graphs with at most r cycles	claim
7	92	Characterization of edge-colored complete graphs with properly colored Hamilton paths	claim
8	81	A Ramsey-type result for the hypercube	claim
9	73	Nearly light cycles in embedded graphs and crossing-critical graphs	claim
10	70	Vertex partitions of chordal graphs	claim
11	60	Spanning subgraphs of graphs partitioned into two isomorphic pieces	claim
12	55	The last excluded case of Dirac's map-color theorem for choosability	claim
13	54	Berge trigraphs	claim
14	53	Graph relations, clique divergence and surface triangulations	claim
15	52	On fans in multigraphs	claim
16	52	On arc-traceable tournaments	claim
17	52	Distinguishing Cartesian powers of graphs	claim
18	48	Maximum pebbling number of graphs of diameter three	claim
19	46	Two-connected orientations of Eulerian graphs	claim
20	43	Improper choosability of graphs and maximum average degree	claim
21	40	How many graphs are unions of k-cliques?	claim
22	35	Claw-decompositions and tutte-orientations	claim
23	28	New upper bounds on the decomposability of planar graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers