Minimal circular-imperfect graphs of large clique number and large independence number Fulltext Access 9 Pages 2008
On 2-factorizations whose automorphism group acts doubly transitively on the factors Fulltext Access 9 Pages 2008
Cycles in a tournament with pairwise zero, one or two given vertices in common Fulltext Access 9 Pages 2008
All graphs with maximum degree three whose complements have 4-cycle decompositions Fulltext Access 9 Pages 2008
Fourier analysis and large independent sets in powers of complete graphs Fulltext Access 9 Pages 2008
A geometric description of the spin-embedding of symplectic dual polar spaces of rank 3 Fulltext Access 9 Pages 2008
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs Fulltext Access 9 Pages 2008
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem Fulltext Access 9 Pages 2008
On planar and non-planar graphs having no chromatic zeros in the interval (1,2)(1,2) Fulltext Access 9 Pages 2008
The maximum number of maximal independent sets in unicyclic connected graphs Fulltext Access 9 Pages 2008
Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax Fulltext Access 9 Pages 2008
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming Fulltext Access 9 Pages 2008
A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams Fulltext Access 9 Pages 2008
On Challenges for a Graphical Transformation Notation and the UMLX Approach Fulltext Access 9 Pages 2008
Semi-automatic Generation of Metamodels and Models From Grammars and Programs Fulltext Access 9 Pages 2008
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs Fulltext Access 9 Pages 2008
On the existence and on the number of (k,l)(k,l)-kernels in the lexicographic product of graphs Fulltext Access 9 Pages 2008
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity Fulltext Access 9 Pages 2008
The Robinson–Schensted correspondence for skew oscillating semi-standard tableaux Fulltext Access 9 Pages 2008
Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs Fulltext Access 9 Pages 2008