DM 1999 - PDF Preprint Papers

DM 1999

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-1999 Paper

click to vote

DM
1999

145views more DM 1999»

Modular decomposition and transitive orientation

13 years 4 months ago

Download www.cs.colostate.edu

A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...

Ross M. McConnell, Jeremy Spinrad

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	145	Modular decomposition and transitive orientation	claim
2	133	The answer to Woodall's musquash problem	claim
3	128	The maximum number of edges in a graph of bounded dimension, with applications to ring theory	claim
4	122	Parking functions, valet functions and priority queues	claim
5	110	Chow's theorem for linear spaces	claim
6	109	Hamiltonian powers in threshold and arborescent comparability graphs	claim
7	109	Complexity of sequences and dynamical systems	claim
8	101	Characterizations of bipartite Steinhaus graphs	claim
9	96	Buekenhout unitals	claim
10	90	The density of ones in Pascal's rhombus	claim
11	90	Induced subgraphs of given sizes	claim
12	89	On the distribution of eigenvalues of graphs	claim
13	86	Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems	claim
14	83	A characterization of uniquely vertex colorable graphs using minimal defining sets	claim
15	81	Basis partitions and Rogers-Ramanujan partitions	claim
16	79	A bijective proof of Riordan's theorem on powers of Fibonacci numbers	claim
17	75	Real and integer domination in graphs	claim
18	73	Enumeration of mosaics	claim
19	70	Tightness problems in the plane	claim
20	69	Maximal sets of mutually orthogonal Latin squares	claim
21	69	On representations of a number as a sum of three squares	claim
22	68	Analytic combinatorics of non-crossing configurations	claim
23	66	Graphical t-designs via polynomial Kramer-Mesner matrices	claim
24	65	Finite three dimensional partial orders which are not sphere orders	claim
25	64	On perfectness of sums of graphs	claim
26	63	A class of functions and their application in constructing semi-biplanes and association schemes	claim
27	62	Directed animals, forests and permutations	claim
28	61	On an equivalence in discrete extremal problems	claim
29	61	Some codes related to BCH-codes of low dimension	claim
30	56	Niemeier lattices and Type II codes over Z4	claim
31	55	Forbidden subsequences and Chebyshev polynomials	claim
32	55	New t-designs and large sets of t-designs	claim
33	52	A simple bijection for the regions of the Shi arrangement of hyperplanes	claim
34	48	Spanning trees of countable graphs omitting sets of dominated ends	claim
35	45	Polarities and 2k-cycle-free graphs	claim
36	41	Superconnectivity of bipartite digraphs and graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers