COMBINATORICS
2002
13 years 11 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
CPC
2006
13 years 11 months ago
2006
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...
DAM
2008
13 years 11 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
DM
2010
13 years 11 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We consider cubic graphs formed with k 2 disjoint claws Ci K1,3 (0 i k-1) such that for every integer i modulo k the three vertices of degree 1 of Ci are joined to the three v...
SODA
1993
ACM
14 years 25 days ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
WAOA
2007
Springer
14 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
STOC
2007
ACM
14 years 12 months ago
2007
ACM