F. R. K. Chung
ABSTRACT
No abstract available.
- 1.F. R. K. Chung and S.-T. Yau, A near optimal algorithm for edge separators, $TOC 94, 1-8. Google Scholar
Digital Library
- 2.Daniel Spielman and Shang-Hua Teng, personal communication.Google Scholar
Index Terms
- Eigenvalues, flows and separators of graphs
Recommendations
On flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279-292]. He proved ...
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Many works related to dually chordal graphs, their cliques and neighborhoods were published by Brandstadt et al. (1998) [1] and Gutierrez (1996) [6]. We will undertake a similar study by considering minimal vertex separators and their properties ...
Nowhere-zero 3-flows in triangularly connected graphs
Let H"1 and H"2 be two subgraphs of a graph G. We say that G is the 2-sum of H"1 and H"2, denoted by H"1@__ __"2H"2, if E(H"1)@__ __E(H"2)=E(G), |V(H"1)@__ __V(H"2)|=2, and |E(H"1)@__ __E(H"2)|=1. A triangle-path in a graph G is a sequence of distinct ...
Comments