202 search results - page 6 / 41 » Large-Girth Roots of Graphs |
100
click to vote
IEICET
2011
14 years 6 months ago
2011
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
COMBINATORICS
2007
14 years 11 months ago
2007
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1, 2) thus resolving a conjecture of Jackson’s in the negative. In addit...
112
click to vote
ICML
2007
IEEE
15 years 12 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...