686 search results - page 73 / 138 » Packing Cycles in Graphs |
104
Voted
RSA
2002
15 years 6 days ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
131
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
107
click to vote
COMBINATORICA
2008
15 years 20 days ago
2008
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
113
Voted
COMBINATORICS
2002
15 years 11 days ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
DM
2002
15 years 11 days ago
2002
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer r...