منابع مشابه
Parity Versions of 2-Connectedness
This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characterized. The realizable, even-realizable, alternating-realizable, dual realizable and dual even-realizable graphs are classified.
متن کامل2 COMPARING TWO VERSIONS OFNIMBUSOPTIMIZATION SYSTEMKaisa
The interactive NIMBUS method has been developed, especially, for nondiier-entiable multiobjective optimization. NIMBUS is needed while many real-world optimization applications include several connicting objectives of possible noncon-vex and nondiierentiable character but appropriate methods are missing. Two versions of the basic method have been developed so far. They are introduced and compa...
متن کامل2-edge-Hamiltonian-connectedness of 4-connected plane graphs
A graph G is called 2-edge-Hamiltonian-connected if for any X ⊂ {x1x2 : x1, x2 ∈ V (G)} with 1 ≤ |X| ≤ 2, G ∪ X has a Hamiltonian cycle containing all edges in X, where G ∪ X is the graph obtained from G by adding all edges in X. In this paper, we show that every 4-connected plane graph is 2edge-Hamiltonian-connected. This result is best possible in many senses and an extension of several known...
متن کاملDetecting connectedness.
Natural visual images are typically composed of multiple objects, which need to be segregated from each other and from the background. The visual system has evolved to capture a great variety of cues that allow a meaningful segmentation of the visual input. One of these cues is connectedness. Connected image regions are likely to belong to a single visual object, whereas disconnected image regi...
متن کاملOn Connectedness of Graphs
A graph structure is deened on the Weyl groups. We show that these graphs are connected for Weyl groups of type An for n 4. 1. Introduction. We have deened a graph structure on Weyl groups through the root system associated with them. The planarity and the other properties of such graphs has been studied elsewhere (1] and 2]). The motivation for these graphs come from the method employed in pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1122