DM 2007 - PDF Preprint Papers

DM 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2007 Paper

click to vote

DM
2007

149views more DM 2007»

Even subgraphs of bridgeless graphs and 2-factors of line graphs

14 years 12 days ago

Download www.maths.qmw.ac.uk

By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...

Bill Jackson, Kiyoshi Yoshimoto

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	149	Even subgraphs of bridgeless graphs and 2-factors of line graphs	claim
2	142	Dominating direct products of graphs	claim
3	136	Lower connectivities of regular graphs with small diameter	claim
4	135	Heavy fans, cycles and paths in weighted graphs of large connectivity	claim
5	129	3-Designs with block size 6 from PSL(2, q) and their large sets	claim
6	125	Generalized switch-setting problems	claim
7	123	Totally anti-symmetric quasigroups for all orders n =/ 2, 6	claim
8	119	Short proofs for cut-and-paste sorting of permutations	claim
9	116	The Ramsey numbers for a cycle of length six or seven versus a clique of order seven	claim
10	114	An inequality for the group chromatic number of a graph	claim
11	113	Counting labeled general cubic graphs	claim
12	112	Affine blocking sets, three-dimensional codes and the Griesmer bound	claim
13	106	The Roberts characterization of proper and unit interval graphs	claim
14	103	On the existence of difference sets in groups of order 96	claim
15	103	Codes from the line graphs of complete multipartite graphs and PD-sets	claim
16	103	Minimum cycle bases of graphs on surfaces	claim
17	101	Threshold graphs, shifted complexes, and graphical complexes	claim
18	100	Decompositions of signed-graphic matroids	claim
19	100	Hamiltonian paths with prescribed edges in hypercubes	claim
20	100	Improved bounds on acyclic edge colouring	claim
21	99	Complexity issues on bounded restrictive H-coloring	claim
22	98	Fast recognition of classes of almost-median graphs	claim
23	98	p-adic valuations and k-regular sequences	claim
24	97	Recognizing Cartesian products in linear time	claim
25	97	L(p, q) labeling of d-dimensional grids	claim
26	93	Small subgraphs of random regular graphs	claim
27	93	Can transitive orientation make sandwich problems easier?	claim
28	92	Strongly simplicial vertices of powers of trees	claim
29	89	New upper bound formulas with parameters for Ramsey numbers	claim
30	87	Gaps in samples of geometric random variables	claim
31	86	Short cycle connectivity	claim
32	84	Matroids on convex geometries (cg-matroids)	claim
33	84	The topology of spaces of phylogenetic trees with symmetry	claim
34	83	Codes identifying sets of vertices in random networks	claim
35	83	Restricted colored permutations and Chebyshev polynomials	claim
36	78	Algebraic shifting of cyclic polytopes and stacked polytopes	claim
37	78	Properties of vertex cover obstructions	claim
38	77	Quadrangularly connected claw-free graphs	claim
39	74	Parameters for which the Griesmer bound is not sharp	claim
40	72	Multicomplexes and polynomials with real zeros	claim
41	72	Homogeneous factorisations of complete multipartite graphs	claim
42	69	On arithmetic and asymptotic properties of up-down numbers	claim
43	68	Constructions and bounds for (m, t)-splitting systems	claim
44	68	Extension of Arrow's theorem to symmetric sets of tournaments	claim
45	67	Feedback numbers of Kautz digraphs	claim
46	66	[r, s, t]-Chromatic numbers and hereditary properties of graphs	claim
47	66	Edge-dominating cycles in graphs	claim
48	65	Using Lagrangians of hypergraphs to find non-jumping numbers(II)	claim
49	64	Vertex-oblique graphs	claim
50	64	Edge-antimagic graphs	claim
51	63	On Sloane's generalization of non-squashing stacks of boxes	claim
52	59	Non-existence of nonorientable regular embeddings of n-dimensional cubes	claim
53	57	Triangulated neighborhoods in even-hole-free graphs	claim
54	57	Four gravity results	claim
55	57	On partitioning of hypergraphs	claim
56	56	On the number of zero-sum subsequences	claim
57	56	Total restrained domination in trees	claim
58	55	On the number of closed walks in vertex-transitive graphs	claim
59	55	On the topology of the free complexes of convex geometries	claim
60	53	The spectrum of Platonic graphs over finite fields	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers