- & Reed (1996);
Maffray (2003). Markossian,
Gasparian & Reed (1996). Gräf,
Stumpf & Weißenfels (1998). Brélaz (1979); Lévêque &
Maffray (2005). Brélaz...
- (1992). Berry,
Golumbic &
Lipshteyn (2007).
Szwarcfiter &
Bornstein (1994).
Maffray (2003). For instance,
Agnarsson (2003),
Remark 2.5,
calls this
method well...
-
previously been
proven by Shrikhande.
Trotter (1977); de
Werra (1978).
Maffray (1992).
Trotter (1977).
Harary (1972),
Theorem 8.4, p. 74,
gives three...
-
perfectly orderable graphs are known. Chvátal (1984);
Maffray (2003).
Middendorf &
Pfeiffer (1990);
Maffray (2003). Golumbic,
Monma &
Trotter (1984). Payan...
- arXiv:math/9506215. doi:10.2307/2975373. JSTOR 2975373. Gravier, Sylvain;
Maffray, Frédéric (2004). "On the
choice number of claw-free
perfect graphs". Discrete...
- distance-hereditary
graph can also be
found in
polynomial time.
Hammer &
Maffray (1990).
Olaru and
Sachs showed the α-perfection of the
graphs in which...
- p. 96; Jung (1978).
Golumbic (1980),
theorems 5.34 and 5.35, p. 133.
Maffray (2003). Golumbic,
Rotem &
Urrutia (1983) and Lovász (1983). See also Fox...
-
Journal on Computing. 1 (2): 180–187. doi:10.1137/0201013. Hammer,
Peter L.;
Maffray, Frédéric (1990). "Completely
separable graphs".
Discrete Applied Mathematics...
-
problem in triangle-free graphs,
proven NP-hard by
Poljak (1974)
Gravier &
Maffray (2004).
Chudnovsky &
Seymour (2010). Faudree,
Flandrin & Ryjáček (1997)...
-
Mathematical Programming, 12 (2): 255–259, doi:10.1007/BF01593791, MR 0457293
Maffray, Frédéric (1992), "Kernels in
perfect line-graphs",
Journal of Combinatorial...
