JGT 2010 - PDF Preprint Papers

JGT 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JGT-2010 Paper

click to vote

JGT
2010

158views more JGT 2010»

Cubicity of interval graphs and the claw number

13 years 10 months ago

Download eprints.iisc.ernet.in

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...

Abhijin Adiga, L. Sunil Chandran

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	158	Cubicity of interval graphs and the claw number	claim
2	152	Cycles of even lengths modulo k	claim
3	151	Balanced coloring of bipartite graphs	claim
4	135	Cycle length parities and the chromatic number	claim
5	128	On antimagic directed graphs	claim
6	127	On the minimum degree of minimal Ramsey graphs	claim
7	117	An approximate version of Hadwiger's conjecture for claw-free graphs	claim
8	113	Crossing numbers of imbalanced graphs	claim
9	113	Coloring plane graphs with independent crossings	claim
10	109	Homomorphism-homogeneous graphs	claim
11	108	Hadwiger number and chromatic number for near regular degree sequences	claim
12	103	Proof of a conjecture on fractional Ramsey numbers	claim
13	103	Characterizing 3-connected planar graphs and graphic matroids	claim
14	93	An asymptotic version of a conjecture by Enomoto and Ota	claim
15	91	Choosability of toroidal graphs without short cycles	claim
16	90	The rainbow connection of a graph is (at most) reciprocal to its minimum degree	claim
17	89	Non-rainbow colorings of 3-, 4- and 5-connected plane graphs	claim
18	87	Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree	claim
19	84	Large classes of infinite k-cop-win graphs	claim
20	83	Forbidden subgraphs and the existence of a 2-factor	claim
21	82	On recognizing graphs by numbers of homomorphisms	claim
22	81	Cycles and paths in edge-colored graphs with given degrees	claim
23	79	Multi-coloring the Mycielskian of graphs	claim
24	79	On Ramsey-type positional games	claim
25	71	A structure theorem for graphs with no cycle with a unique chord and its consequences	claim
26	70	Infinite families of crossing-critical graphs with prescribed average degree and crossing number	claim
27	63	Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs	claim
28	61	Vertex-pancyclicity of hypertournaments	claim
29	57	NZ-flows in strong products of graphs	claim
30	52	Rooted induced trees in triangle-free graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers