31951842
The chromaticity of certain graphs with five triangles
Abstract Let W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of W(n, 6) which can be obtained from the coefficients of the chromatic polynomial of W(n, 6). In particular, we prove that W(n, 6) is chromatically unique for all integers n⩾8. We also obtain two additional families of chromatically unique graphs.
911709
Homeomorphs and amallamorphs of the Petersen graph
Let P be the Petersen graph. The main results of this paper are the discovery of infinite families of chromatically equivalent pairs of P homeomorphs and the discovery of infinite families of flow equivalent pairs of P amallamorphs. In particular, three families of P homeomorphs with 8 parameters, five families with 7 parameters and many families with fewer parameters are obtained. Also one family of P amallamorphs with 9 parameters, three families with 7 parameters, seven families with 6 parameters and many families with fewer parameters are obtained.
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.
20403548
The chromatic uniqueness of W10
Abstract Xu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is known that the wheels on six vertices and eight vertices are not chromatically unique. Read found that the wheel on ten vertices is chromatically unique by computer computations. Here, we sketch a mathematical proof of the chromatic uniqueness of the wheel on ten vertices.
17288174
The Tutte polynomial for homeomorphism classes of graphs
We study a polynomial which contains, as special cases, the Tutte polynomials of all members of a given homeomorphism class of graphs. We further show that this polynomial can be directly derived from the chain polynomial introduced in [1].
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.
9355668
The WebDAV property design
This paper provides a detailed description of the general design space for metadata storage capabilities. The design space considers issues of metadata identification, typing and representation, dynamic behavior, predefined and user-defined metadata, schema discovery/update, operations, API packaging/marshalling, searching, and versioning. The design space is used to structure a retrospective analysis of the three major alternative metadata designs considered during the design of the WebDAV distributed authoring protocol. Deployment experience with WebDAV properties is also discussed, with the most successful use occurring in custom client/server pairs and in protocol extensions.
9962381
An architectural model for application integration in open hypermedia environments
This paper provides an architectural framework for modeling third-party application integrations with open hypermedia systems, which collects and extends the integration experience of the open hypermedia community. The framework is used to characterize applications prior to integration, and describe the qualities of a complete integration. Elements of the architectural model are artists, which are used to manipulate anchors, links, and native application objects; communicators, which manage information flow to and from the open hypermedia system; and containers which group the other elements. Prior integration experience is collected in a standard way using the model. Guidance in selecting the final integration architecture is provided by this prior integration experience, in conjunction with the degree of difficulty of an integration, which is related to the integration architecture.
9717322
Mining version archives for co-changed lines
Files, classes, or methods have frequently been investigated in recent research on co-change. In this paper, we present a first study at the level of lines. To identify line changes across several versions, we define the annotation graph which captures how lines evolve over time. The annotation graph provides more fine-grained software evolution information such as life cycles of each line and related changes: "Whenever a developer changed line 1 of version.txt she also changed line 25 of Library.java."
9755399
Uniform Comparison of Configuration Management Data Models
The data models of a series of 11 configuration management systems--of varying type and complexity--are represented using containment data models. Containment data models are a specialized form of entityrelationship model in which entities may be containers or atoms, and the only permitted form of relationship is inclusion or referential containment. By using entities to represent the native abstractions of each system, and containment relationships to model inclusion and identifier references, systems can be modeled uniformly, permitting consistent cross-comparison of systems.
17717719
Design spaces for link and structure versioning
This paper reflects upon existing composite-based hypertext versioning systems, and presents two high-level design spaces that capture the range of potential choices in system data models for versioning links, and versioning hypertext structure. These two design spaces rest upon a foundation consisting of a containment model, describing choices for containment in hypertext systems, and the design space for persistently recording an object's revision history, with applicability to all versioning systems. Two example points in the structure versioning design space are presented, corresponding to most existing composite-based hypertext versioning systems. Using the presented design spaces allows the data models of existing hypertext versioning systems to be decomposed and compared in a principled way, and provides new system designers significant insight into the design tradeoffs between various link and structure versioning approaches.