We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. © 2015 Elsevier B.V. All rights reserved.

background: the i-space is a radiological imaging system in which computed tomography (ct)-scans can be evaluated as a three dimensional hologram. the aim of this study is to analyze the value of virtual reality (i-space) in diagnosing acute occult scaphoid fractures.   methods: a convenient cohort of 24 patients with a ct-scan from prior studies, without a scaphoid fracture on radiograph, yet ...

Based on the sample type, TEM imaging can be classified into cross-sectional TEM (XTEM) and planeview TEM (PTEM). The advantage of XTEM is that it shows stacked layer structures that reflect the manufacturing process steps. Plane-view TEM, on the other hand, is suitable for cases where either the exact defect location has not been isolated for XTEM or the anomaly has affected structures more la...

In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...

Forbidden minors and subdivisions for toroidal graphs are numerous. In contrast, the toroidal graphs with no K3,3’s have a nice explicit structure and short lists of obstructions. For these graphs, we provide the complete lists of four forbidden minors and eleven forbidden subdivisions.

A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G − {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.

Three-dimensional (3-D) cloud characterization permits the derivation of important cloud geometry properties such as fractional cloudiness, mean cloud and clear length, aspect ratio, and the morphology of cloud cover. These properties are needed as input to the hierarchical diagnosis (HD) and instantaneous radiative transfer (IRF) models, to validate sub-models for cloud occurrence and formatio...