62 search results - page 1 / 13 » Induced trees in triangle-free graphs |
120
Voted
DM
2002
15 years 29 days ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
67
Voted
ENDM
2007
15 years 1 months ago
2007
71
Voted
JGT
2010
14 years 11 months ago
2010
103
Voted
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
134
Voted
FAW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...