Simultaneous graph parameters: Factor domination and factor total domination Fulltext Access 5 Pages 2006
Connected factors in K1,nK1,n-free graphs containing an [a,b][a,b]-factor Fulltext Access 5 Pages 2006
Constructing one-regular graphs of valency 4k4k with non-cyclic vertex stabilizer Fulltext Access 5 Pages 2006
Some relations among term rank, clique number and list chromatic number of a graph Fulltext Access 5 Pages 2006
What are the Fundamental Structures of Concurrency?: We still don't know! Fulltext Access 5 Pages 2006
A simple expected running time analysis for randomized “divide and conquer” algorithms Fulltext Access 5 Pages 2006
Corrigendum to “On the undecidability of implications between embedded multivalued database dependencies” [Inform. and Comput. 122 (1995) 221-235] Fulltext Access 5 Pages 2006
What Kind of Verification of Formal Navigation Modelling for Reliable and Usable Web Applications? Fulltext Access 5 Pages 2006
Process Calculi: The End of the Beginning?: (From Thought Experiments to Experimental Semantics) Fulltext Access 5 Pages 2006
On the canonical metric representation, average distance, and partial Hamming graphs Fulltext Access 6 Pages 2006
Cantor–Bernstein type theorem for locally constrained graph homomorphisms Fulltext Access 6 Pages 2006