#### Filter Results:

- Full text PDF available (36)

#### Publication Year

1981

2015

- This year (0)
- Last 5 years (11)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo
- J. Comb. Theory, Ser. B
- 1989

- Odile Favaron, Maryvonne Mahéo, Jean-François Saclé
- Discrete Mathematics
- 1993

- Odile Favaron
- Discrete Mathematics
- 1982

- Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason
- Discrete Mathematics
- 1981

A vertex x in a subset X of vertices of an undirected graph is dm.dant if its closed neighbourhowl is contained in the union c\f closed neigl&ourh&s of vertices o F X--(x}. In tI;e context of a communications network, this means that any vertw which may rexive cornmunications from X may also be informed from X-(x). The lower tend upper incdu +&wee aumbers… (More)

- Odile Favaron
- J. Comb. Theory, Ser. B
- 1985

- Odile Favaron
- Discussiones Mathematicae Graph Theory
- 1996

A graph is said to be k-factor-critical if the removal of any set of k vertices results in a graph with a perfect matching. We study some properties of k-factor-critical graphs and show that many results on q-extendable graphs can be improved using this concept.

- Charles Delorme, Odile Favaron, Dieter Rautenbach
- Discrete Mathematics
- 2002

- Odile Favaron, Pierre Fraisse
- J. Comb. Theory, Ser. B
- 2001

- Odile Favaron, Maryvonne Mahéo, Jean-François Saclé
- Journal of Graph Theory
- 1991

- Odile Favaron, Gerd Fricke, +5 authors R. Duane Skaggs
- Discussiones Mathematicae Graph Theory
- 2004

A set S is an offensive alliance if for every vertex v in its boundary N(S)−S it holds that the majority of vertices in v’s closed neighbourhood are in S. The offensive alliance number is the minimum cardinality of an offensive alliance. In this paper we explore the bounds on the offensive alliance and the strong offensive alliance numbers (where a strict… (More)