JGT 2008 - PDF Preprint Papers

JGT 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JGT-2008 Paper

click to vote

JGT
2008

150views more JGT 2008»

Cycle spaces in topological spaces

14 years 16 days ago

Download www.math.uwaterloo.ca

: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...

Antoine Vella, R. Bruce Richter

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	150	Cycle spaces in topological spaces	claim
2	107	On planar intersection graphs with forbidden subgraphs	claim
3	105	The bond and cycle spaces of an infinite graph	claim
4	103	Game coloring the Cartesian product of graphs	claim
5	97	On the oriented chromatic index of oriented graphs	claim
6	92	A new upper bound for the bipartite Ramsey problem	claim
7	91	On the editing distance of graphs	claim
8	88	On k-detour subgraphs of hypercubes	claim
9	88	On minimum sets of 1-factors covering a complete multipartite graph	claim
10	83	Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs	claim
11	78	Circular chromatic index of Cartesian products of graphs	claim
12	77	List-coloring the square of a subcubic graph	claim
13	77	Graph classes characterized both by forbidden subgraphs and degree sequences	claim
14	75	On two questions about circular choosability	claim
15	74	Straight line embeddings of cubic planar graphs with integer edge lengths	claim
16	69	List colorings with measurable sets	claim
17	64	Inequalities for the first-fit chromatic number	claim
18	64	Hadwiger's conjecture for quasi-line graphs	claim
19	63	Cutting two graphs simultaneously	claim
20	61	Cycles passing through k + 1 vertices in k-connected graphs	claim
21	61	Irregularity strength of dense graphs	claim
22	59	Pebbling and optimal pebbling in graphs	claim
23	58	Some remarks about factors of graphs	claim
24	58	Disjoint T-paths in tough graphs	claim
25	55	Ore-type degree conditions for a graph to be H-linked	claim
26	54	Rank-width is less than or equal to branch-width	claim
27	51	On H-immersions	claim
28	49	Circular choosability via combinatorial Nullstellensatz	claim
29	46	A note on complete subdivisions in digraphs of large outdegree	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers