4865 search results - page 177 / 973 » The Complexity of Graph Connectivity |
133
click to vote
APPML
2006
15 years 3 months ago
2006
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
125
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
109
click to vote
DM
2006
15 years 3 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
142
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
115
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...