36 search results - page 6 / 8 » Independence Free Graphs and Vertex Connectivity Augmentatio... |
160
Voted
JGT
2006
15 years 5 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
155
click to vote
FOCS
2009
IEEE
16 years 11 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
144
click to vote
TCS
2010
15 years 10 days ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
149
click to vote
CSE
2009
IEEE
16 years 11 days ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
185
Voted
ALGORITHMICA
2008
15 years 5 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...