JGT 2007 - PDF Preprint Papers

JGT 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JGT-2007 Paper

click to vote

JGT
2007

146views more JGT 2007»

Compatible circuit decompositions of 4-regular graphs

13 years 11 months ago

Download www.maths.qmw.ac.uk

A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...

Herbert Fleischner, François Genest, Bill J...

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	146	Compatible circuit decompositions of 4-regular graphs	claim
2	130	Vertex partitions and maximum degenerate subgraphs	claim
3	112	The 2-dimensional rigidity of certain families of graphs	claim
4	99	The upper bound of the number of cycles in a 2-factor of a line graph	claim
5	99	Backbone colorings for graphs: Tree and path backbones	claim
6	87	A new upper bound on the cyclic chromatic number	claim
7	85	Between ends and fibers	claim
8	85	Coloring quasi-line graphs	claim
9	85	On self duality of pathwidth in polyhedral graph embeddings	claim
10	85	On graphs with subgraphs having large independence numbers	claim
11	81	Independent dominating sets and hamiltonian cycles	claim
12	81	Pathwidth of outerplanar graphs	claim
13	81	Maximum directed cuts in acyclic digraphs	claim
14	76	Total chromatic number of planar graphs with maximum degree ten	claim
15	74	About paths with two blocks	claim
16	73	New bounds on the edge number of a k-map graph	claim
17	73	Independence number and clique minors	claim
18	69	The size of minimum 3-trees	claim
19	68	Forcing highly connected subgraphs	claim
20	68	Tutte sets in graphs I: Maximal tutte sets and D-graphs	claim
21	64	Interval Tournaments	claim
22	64	Finite symmetric graphs with two-arc transitive quotients II	claim
23	59	Hereditary properties of combinatorial structures: Posets and oriented graphs	claim
24	55	Hamilton cycles in prisms	claim
25	54	Overlap in consistent cycles	claim
26	53	A planar hypohamiltonian graph with 48 vertices	claim
27	53	Remarks on the second neighborhood problem	claim
28	50	More intrinsically knotted graphs	claim
29	49	Independent sets in tensor graph powers	claim
30	45	Density of universal classes of series-parallel graphs	claim
31	43	Tripartite Ramsey numbers for paths	claim
32	42	Spanning trees with leaf distance at least four	claim
33	41	List circular coloring of trees and cycles	claim
34	40	Simultaneous diagonal flips in plane triangulations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers