Searching for "On local connectivity of graphs." – sorted by Relevance.
-
Every 3-Connected, Locally Connected, Claw-Free Graph is Hamilton-Connected
- 1 Every 3-Connected, Locally Connected, Claw-Free Graph is Hamilton-Connected A.S. Asratian
- Add To MetaCart
-
Hamiltonian N2-locally Connected Claw-Free Graphs
- Hamiltonian N2-locally Connected Claw-Free Graphs Hong-Jian Lai, Yehong Shao and Mingquan Zhan
- Cited by 2 (2 self) – Add To MetaCart
-
Segmentation by Example
- . The algorithm consists of two stages. In the first stage we construct a locally connected graph to represent
- Cited by 3 (0 self) – Add To MetaCart
-
On Distance Local Connectivity and Vertex Distance Colouring
- . In this paper, we give some sufficient conditions for distance local connectivity of a graph, and a degree
- Add To MetaCart
-
On Distance Local Connectivity and the Hamiltonian Index
- Abstract. In this paper we introduce the concept of distance local connectivity of a graph. We give several
- Add To MetaCart
-
Cyclic properties of triangular grid graphs
- class of locally connected triangular grid graphs. Namely, we prove that all connected, locally
- Cited by 1 (0 self) – Add To MetaCart
-
Faster Graph-Theoretic Image Processing via Small-World and Quadtree Topologies
- examine two image graphs that preserve local connectivity of the nodes (pixels) while drastically reducing
- Cited by 4 (2 self) – Add To MetaCart
-
Structural Constraints and Neutrality in RNA
- in the sequence length, this being possible because of local connectivity, a special property of graphs under
- Cited by 7 (2 self) – Add To MetaCart
-
Seed-Growth Heuristics for Graph Bisection
- algorithms are based on a simple seed-growth heuristic, which uses only the local connectivity of the graph
- Add To MetaCart
-
Quadrangularly connected claw-free graphs, submitted
- that every locally connected graph is N2-locally connected. A cycle of length k is called a k-cycle. Given a
- Cited by 1 (1 self) – Add To MetaCart

