Apr 27, 2010 · Okamura H.: 2-reducible paths containing a specified edge in (2k + 1)-edge-connected graphs. ARS Combinatria 61, 211–220 (2001). MATH ...
In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more ...
LetG be ak-edge-connected graph and letf 1,f 0,f 2 be consecutive edges. We call a cycleC (not necessarily simple) 2-reducible ifG − E(C) is (k ...
In this paper we give graphs with the largest known order for a given degree $\Delta$ and diameter $D$. The graphs are constructed from Moore bipartite graphs ...
This thesis analyzes several approaches to the general k-ECSS problem of mixed graphs and gives a factor 2 approximation for a special case in which all ...
Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs ... Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs ... having no 2-reducible cycle ...
Okamura H(2018)2-reducible cycles containing three consecutive edges ... (J Graph Theory 1:79 ... Okamura H(2005)Two Paths Joining Given Vertices in 2k-Edge ...
People also ask
What is 2 edge connected?
What is a 2 edge connected graph that is not 3 edge connected?
What is an edge-connected graph?
What are two vertices in a graph that are connected by an edge?
Jun 10, 2024 · Haruko Okamura: 2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs. Graphs Comb. 26(4): 571-589 (2010).
D34: A subgraph H of a k-edge-connected graph G is said to be ρ-reducible if the graph obtained from G by removing the edges of H is (k ρ)-connected. FACTS. F56 ...
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs. Ars Combinatoria. 巻: 61; 号: 開始ページ: 211; 終了ページ: 220. エクスポート ...