1749 search results - page 117 / 350 » Conditional colorings of graphs |
132
click to vote
DM
2006
15 years 6 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
158
click to vote
IPL
2002
15 years 6 months ago
2002
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
163
click to vote
IJFCS
2006
15 years 6 months ago
2006
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
159
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...