Favaron, Odile
VIAF ID: 59145304388278571078 (Personal)
Permalink: http://viaf.org/viaf/59145304388278571078
Preferred Forms
- 200 _ | ‡a Favaron ‡b Odile
-
- 100 1 _ ‡a Favaron, Odile
- 100 1 _ ‡a Favaron, Odile
-
4xx's: Alternate Name Forms (2)
Works
Title | Sources |
---|---|
The b-domatic number of a graph | |
Biclosure and bistability in a balanced bipartite graph | |
A bound on the independent domination number of a tree | |
Combinatoire et algorithmique pour la licence MAF | |
COMMUNICATION IN INTERCONNECTION NETWORKS AND GENERALIZED DEGREES IN GRAPHS. | |
The complete closure of a graph | |
Edge-vulnerability and mean distance | |
Extendability and factor-criticality | |
Forbidden subgraphs, closure and hamiltonicity | |
Graphs with a small max-cut | |
Hamiltonian properties of bipartite graphs and digraphs with bipartite independence 2 | |
The helms are graceful | |
Independence and hamiltonicity in 3-domination-critical graphs | |
An inequality chain of domination parameters for trees | |
Irredundance in grids | |
Irredundant and perfect neighborhood sets in graphs and claw-free graphs | |
Minimum independent generalized t-degree and independence number in graphs without large induced stars | |
Offensive alliances in graphs | |
On a conjecture of Fink and Jacobson concerning the k-domination and the k-dependence | |
On distances and eccentricities in the shuffle-exchange network | |
On k-factor-critical graphs | |
On m-centers in Pt-free graphs | |
On the cyclability of graphs | |
On the sizes of least common multiples of several pairs of graphs | |
An ore-type condition for pancyclability | |
Pancyclism and small cycles in graphs | |
Path partitions and cycle partitions of eulerian graphs of maximum degree 4 | |
Recherche à voisinage variable de graphes extrémaux, 26 : nouveaux résultats sur la maille | |
RELATIONS ENTRE PARAMETRES DE GRAPHES | |
Shortest walks in almost claw-free graphs | |
Signed domination in regular graphs | |
Some results on conjectures of graffiti III | |
Stability, domination, irredundance and other parameters of graphs. | |
Strong edge colorings of graphs | |
A Sufficient condition for oriented graphs to be hamiltonian | |
Sur une Conjecture de Cockayne et Holyer concernant les stables maximaux | |
Variable neighborhood search for extremal graphs, 22 : extending bounds for independence to upper irredundance | |
Very well covered graph |