686 search results - page 25 / 138 » Packing Cycles in Graphs |
120
click to vote
WIRN
2005
Springer
15 years 5 months ago
2005
Springer
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
CORR
2004
Springer
15 years 6 days ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
133
click to vote
LANMR
2004
15 years 1 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
127
click to vote
JGT
2010
14 years 10 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
96
Voted
JCT
2006
15 years 9 days ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....