3008 search results - page 139 / 602 » Independence in connected graphs |
175
click to vote
EJC
2011
15 years 1 months ago
2011
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
124
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
126
click to vote
DAM
1999
15 years 6 months ago
1999
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
182
click to vote
DAM
1999
15 years 6 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
142
click to vote
DAM
2007
15 years 6 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...