6916623
Chromatic polynomials of generalized trees
Abstract This paper is a survey of results on chromatic polynomials of graphs which are generalizations of trees. In particular, chromatic polynomials of q -trees will be discussed. The smallest q -tree ( q ≥1) is the complete graph K q on q vertices. A q -tree on n +1 vertices where n ≥ q , is obtained by adding a new vertex adjacent to each of q arbitrarily selected, mutually adjacent vertices in a q -tree on n vertices. Another generalization of trees is the n -gon-trees. The smallest n -gon-tree ( n ≥3) is the n -gon which is a cycle of n vertices. A n -gon-tree with k +1 n -gons is obtained from a n -gon-tree with k n -gons by adding a new n -gon which has exactly one edge in common with any n -gon of a n -gon-tree with k n -gons.
9513339
Chromatic polynomials of homeomorphism classes of graphs
Abstract We study a multilinear polynomial which subsumes the chromatic polynomials of all the graphs in a given homeomorphism class. We show that this polynomial can be extended to include further families of homeomorphic graphs, and derive some properties of its coefficients. We also prove similar results for the dual concept of graphs with multiple edges.
205877725
Chromaticity of a family of K4 homeomorphs
Abstract A K 4 homeomorph can be described as a graph on n vertices having 4 vertices of degree 3 and n − 4 vertices of degree 2; each pair of degree 3 vertices is joined by a path. We study the chromatic uniqueness and chromatic equivalence of one family of K 4 homeomorphs. This family has exactly 3 paths of length one. The results of this study leads us to solve 3 of the problems posed by Koh and Teo in their 1990 survey paper which appeared in Graphs and Combinatorics.
21934141
Micro pattern evolution
When analyzing the evolution history of a software project, we wish to develop results that generalize across projects. One approach is to analyze design patterns, permitting characteristics of the evolution to be associated with patterns, instead of source code. Traditional design patterns are generally not amenable to reliable automatic extraction from source code, yet automation is crucial for scalable evolution analysis. Instead, we analyze "micro pattern" evolution; patterns whose abstraction level is closer to source code, and designed to be automatically extractable from Java source code or bytecode. We perform micro-pattern evolution analysis on three open source projects, ArgoUML, Columba, and jEdit to identify micro pattern frequencies, common kinds of pattern evolution, and bug-prone patterns. In all analyzed projects, we found that the micro patterns of Java classes do not change often. Common bug-prone pattern evolution kinds are 'Pool → Pool', 'Implementor → NONE', and 'Sampler → Sampler'. Among all pattern evolution kinds, 'Box', 'CompoundBox', 'Pool', 'CommonState', and 'Outline' micro patterns have high bug rates, but they have low frequencies and a small number of changes. The pattern evolution kinds that are bug-prone are somewhat similar across projects. The bug-prone pattern evolution kinds of two different periods of the same project are almost identical.
5345896
Properties of academic paper references
We propose a new method to find related papers using an input paper and its hyperlinked citation relationships rather than keywords. Such related papers are especially useful as background reading for researchers new to a research field. In this paper we introduce the background reading paper extractor (BPE), and show various properties of academic paper references.
33944922
Containment Modeling of Content Management Systems
Containment models are a specialized form of entity-relationship model in which the only allowed form of relationship is a 'contains' relationship. This paper builds on the authors' previous work on containment modeling by clarifying the graphical notation and increasing the expressiveness of the model in a way that expands the technique to systems outside the hypertext domain. Examples from the hypertext, hypertext versioning, and configuration management domains illustrate the cross-domain applicability of this technique.
2542573
Control choices and network effects in hypertext systems
When the utility of a hypertext system depends on the number of users and amount of data in the system, the system exhibits network effects. This paper examines how the core differences in control assumptions between monolithic hypertext systems, open hypermedia systems, and the Web, lead to different incentive structures for readers and content providers and hence varying levels of
45780832
Collaborative Work: Distributed Authoring and Versioning