DM 2006 - PDF Preprint Papers

DM 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2006 Paper

click to vote

DM
2006

144views more DM 2006»

On almost self-complementary graphs

14 years 14 days ago

Download www.fmf.uni-lj.si

A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...

Primoz Potocnik, Mateja Sajna

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	144	On almost self-complementary graphs	claim
2	143	Characterization of eccentric digraphs	claim
3	135	Berge's conjecture on directed path partitions - a survey	claim
4	134	Simultaneous graph parameters: Factor domination and factor total domination	claim
5	132	Recursive fault-tolerance of Fibonacci cube in hypercubes	claim
6	128	Non-trivial t-designs without repeated blocks exist for all t	claim
7	124	Hall ratio of the Mycielski graphs	claim
8	122	Labeling trees with a condition at distance two	claim
9	121	The acircuitic directed star arboricity of subcubic graphs is at most four	claim
10	115	3-Designs from PSL(2, q)	claim
11	108	Optimal broadcast domination in polynomial time	claim
12	107	On a new reformulation of Hadwiger's conjecture	claim
13	105	Large sets of t-designs through partitionable sets: A survey	claim
14	104	Construction of trees and graphs with equal domination parameters	claim
15	103	Bounds on the forcing numbers of bipartite graphs	claim
16	103	Graph polynomials from principal pivoting	claim
17	101	Cycle double covers and spanning minors II	claim
18	101	Collapsible biclaw-free graphs	claim
19	99	Bias matroids with unique graphical representations	claim
20	95	Extending a matroid by a cocircuit	claim
21	93	Consistency for partition regular equations	claim
22	93	The number of equivalence classes of symmetric sign patterns	claim
23	92	Minimal triangulations of graphs: A survey	claim
24	92	Independence and coloring properties of direct products of some vertex-transitive graphs	claim
25	92	Sums of powers of the degrees of a graph	claim
26	92	Converse to the Parter-Wiener theorem: The case of non-trees	claim
27	91	Fast perfect sampling from linear extensions	claim
28	91	On the unique representability of spikes over prime fields	claim
29	91	Restricted Dumont permutations, Dyck paths, and noncrossing partitions	claim
30	89	On the direct limit of a direct system of multialgebras	claim
31	89	On set systems with a threshold property	claim
32	87	A vertex incremental approach for maintaining chordality	claim
33	86	Decomposing oriented graphs into transitive tournaments	claim
34	86	Minimal rankings and the arank number of a path	claim
35	85	Upper minus domination in a claw-free cubic graph	claim
36	85	Further analysis of the number of spanning trees in circulant graphs	claim
37	85	Transversal numbers of translates of a convex body	claim
38	84	Hamilton cycles in digraphs of unitary matrices	claim
39	84	Indefinite summation with unspecified summands	claim
40	83	Edmonds polytopes and a hierarchy of combinatorial problems	claim
41	83	A note on k-cop, l-robber games on graphs	claim
42	83	Language structure of pattern Sturmian words	claim
43	82	On the extension of vertex maps to graph homomorphisms	claim
44	81	On an adjacency property of almost all tournaments	claim
45	81	A combinatorial identity with application to Catalan numbers	claim
46	80	A class of combinatorial identities	claim
47	79	Restricted even permutations and Chebyshev polynomials	claim
48	79	Conditional colorings of graphs	claim
49	78	On polynomial digraphs	claim
50	78	On induced and isometric embeddings of graphs into the strong product of paths	claim
51	77	Strong edge-coloring of graphs with maximum degree 4 using 22 colors	claim
52	76	Lex M versus MCS-M	claim
53	75	Counting occurrences of 231 in an involution	claim
54	74	Asymptotic values of the Hall-ratio for graph powers	claim
55	73	Contributions to zero-sum problems	claim
56	73	Listing all the minimal separators of a 3-connected planar graph	claim
57	73	Composition of Post classes and normal forms of Boolean functions	claim
58	72	Patterson-Wiedemann construction revisited	claim
59	72	Designs on the web	claim
60	72	Sparse anti-magic squares and vertex-magic labelings of bipartite graphs	claim
61	71	Tight quadrangulations on the sphere	claim
62	71	Spanning trails containing given edges	claim
63	71	Pair lengths of product graphs	claim
64	71	Homothetic interval orders	claim
65	70	Improving probability bounds by optimization over subsets	claim
66	70	The carvingwidth of hypercubes	claim
67	70	Transversals in long rectangular arrays	claim
68	68	A note on maximally repeated sub-patterns of a point set	claim
69	66	On the role of hypercubes in the resonance graphs of benzenoid graphs	claim
70	65	Hex and combinatorics	claim
71	64	Path extendability of claw-free graphs	claim
72	63	Safe separators for treewidth	claim
73	63	Profile minimization on products of graphs	claim
74	63	Efficient crossover designs for comparing test treatments with a control treatment	claim
75	63	Extended skew partition problem	claim
76	62	A family of weakly distance-regular digraphs of girth 2	claim
77	61	A degree bound on decomposable trees	claim
78	61	On geodetic sets formed by boundary vertices	claim
79	60	On cycles through specified vertices	claim
80	60	Extended directed triple systems	claim
81	59	Factors of the Gaussian coefficients	claim
82	58	Linear transformations on codes	claim
83	57	Triangulations of orientable surfaces by complete tripartite graphs	claim
84	55	The intricacy of avoiding arrays is 2	claim
85	55	Rainbow solutions of linear equations over Zp	claim
86	55	A note on short cycles in a hypercube	claim
87	54	Enumeration of M-partitions	claim
88	54	Small surface trades in triangular embeddings	claim
89	54	A note on interconnecting matchings in graphs	claim
90	54	Self-dual, not self-polar	claim
91	52	Self-clique Helly circular-arc graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers