-
Martin Charles Golumbic (born 1948) is a
mathematician and
computer scientist known for his
research on
perfect graphs,
graph sandwich problems, compiler...
- Földes &
Hammer (1977a);
Golumbic (1980),
Theorem 6.3, p. 151.
Golumbic (1980),
Theorem 6.1, p. 150. Földes &
Hammer (1977a);
Golumbic (1980),
Theorem 6.3...
-
corollary 6.4.1, p. 96; Jung (1978).
Golumbic (1980),
theorems 5.34 and 5.35, p. 133.
Maffray (2003).
Golumbic,
Rotem &
Urrutia (1983) and Lovász (1983)...
-
graphs were
first studied by (Wolk 1962, 1965) but were
named by
Golumbic (1978);
Golumbic writes that "the name was
chosen since it is
trivial to show that...
- evaluations.
Golumbic &
Gurvich (2011), p. 519.
Golumbic &
Gurvich (2011), p. 520.
Golumbic &
Gurvich (2011),
Theorem 10.1, p. 521;
Golumbic,
Mintz & Rotics...
-
Institute of
Mathematical Sciences.
Robert B. K. Dewar;
Martin Charles Golumbic;
Clinton F. Goss (August 2013) [First
published October 1979].
MICRO SPITBOL...
- (1988).
Golumbic (1980).
Golumbic (1980), p. 159. Even,
Pnueli &
Lempel (1972).
Blair &
Peyton (1993),
Lemma 4.5, p. 19.
Gavril (1973);
Golumbic (1980)...
- tolerances. This
class of
graphs was
introduced in 1982 by
Martin Charles Golumbic and
Clyde Monma, who used them to
model scheduling problems in
which the...
- Gibbons, Alan (1985).
Algorithmic Graph Theory.
Cambridge University Press.
Golumbic,
Martin (1980).
Algorithmic Graph Theory and
Perfect Graphs.
Academic Press...
- by
using the
union of a row and a
column as a separator.
Jordan (1869)
Golumbic (1980). Escalante, F. (1972). "Schnittverbände in Graphen". Abhandlungen...
