3471 search results - page 37 / 695 » Obstacle Numbers of Graphs |
117
click to vote
CPC
2007
15 years 2 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
98
Voted
WG
2009
Springer
15 years 9 months ago
2009
Springer
102
Voted
GD
2005
Springer
15 years 8 months ago
2005
Springer
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
FOCS
1989
IEEE
15 years 6 months ago
1989
IEEE