- (Grünbaum 1973) A(G) ≤ 5 if Δ(G) = 4. (Burstein 1979) A(G) ≤ 7 if Δ(G) = 5. (
Kostochka &
Stocker 2011) A(G) ≤ 12 if Δ(G) = 6. (Varagani et al. 2009) A milestone...
-
bounds see Černý (2007), Gyárfás (1985),
Kostochka (1988), and
Kostochka & Kratochvíl (1997). See
Kostochka (1988) for the
upper bound, and
Ageev (1996)...
- {\displaystyle K_{4,4}} minor.
Kostochka (1984). The
letter O {\displaystyle O} in this
expression invokes big O notation.
Kostochka (1984).
Thomason (1984)...
- (2006), pp. 80–82;
Robertson &
Seymour (2003).
Mader (1967).
Kostochka (1982);
Kostochka (1984);
Thomason (1984);
Thomason (2001). Alon,
Seymour & Thomas...
-
typically no
longer than
three minutes each.
Coursmos was
founded by
Roman Kostochka and
Vyacheslav Grachev. The
concept was
developed based on a
YouTube study...
-
Kierstead &
Kostochka (2008). A
polynomial time
algorithm for
finding equitable colorings with this many
colors was
described by
Kierstead and
Kostochka; they...
- B. 94 (1): 147–158. doi:10.1016/j.ejc.2007.06.020. Borodin, Oleg V.;
Kostochka,
Alexandr V.; Sheikh,
Naeem N.; Yu,
Gexin (2008). "Decomposing a planar...
- It has been
verified for k ≤ 20 {\displaystyle k\leq 20} by
Alexandr Kostochka, but
remains open in the
general case (as of July 2024). The conjecture...
-
Catlin & Erdős (1980).
Halin (1976). Robertson,
Seymour &
Thomas (1993b).
Kostochka (1984);
Thomason (2001). The
letters O and Ω in
these expressions invoke...
- Grünbaum (1963).
Steinberg &
Younger (1989). Thom****en (2003) Glebov,
Kostochka &
Tashkinov (2005).
Asghar (2012) Dvořák, Zdeněk; Kráľ, Daniel; Thomas...
