51 search results - page 3 / 11 » Extremal properties of (1, f)-odd factors in graphs |
ICPP
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
103
Voted
TCS
2008
14 years 11 months ago
2008
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
87
Voted
GC
2007
Springer
14 years 11 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...