5 search results - page 1 / 1 » A Planar Linear Arboricity Conjecture |
77
Voted
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
IPL
2007
15 years 1 hour ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
103
click to vote
DM
2010
15 years 5 days ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
100
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
90
Voted
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...