- 629–657, CiteSeerX 10.1.1.597.5634, doi:10.1137/05064299X. Fomin,
Fedor V.;
Todinca, Ioan; Villanger,
Yngve (2015), "Large
induced subgraphs via triangulations...
-
Chartrand et al. (1994). Barioli,
Fallat &
Hogben (2004). Kratsch, Müller &
Todinca (2003).
Gavril (2002). Le, Le & Müller (2003).
Berman &
Schnitger (1992)...
- (1991),
Theorem 4.1, p. 164.
Bodlaender &
Thilikos (1997). Fomin,
Mazoit &
Todinca (2009)
describe an
algorithm with
improved dependence on k, (2√3)k, at...
- doi:10.1006/jagm.1995.1009, MR 1317666. Fomin,
Fedor V.; Kratsch, Dieter;
Todinca, Ioan (2004), "Exact (exponential)
algorithms for
treewidth and minimum...
- any
chordal graph must be a
comparability graph of this type.
Suchan &
Todinca (2007). Feige,
Hajiaghayi & Lee (2005).
Robertson &
Seymour (2004). Bienstock...
- 82, ISBN 9781846289699. Weisstein, Eric W., "Graph Power",
MathWorld Todinca, Ioan (2003), "Coloring
powers of
graphs of
bounded clique-width", Graph-theoretic...
-
Olariu (2000), Theorem 5.5.
Gurski & ****e (2000). Oum &
Seymour (2006).
Todinca (2003).
Gurski & ****e (2009).
Cogis &
Thierry (2005). Courcelle, Makowsky...
- 1016/j.jctb.2008.06.004, MR 2467827. Chapelle, Mathieu; Mazoit, Frédéric;
Todinca, Ioan (2009), "Constructing brambles",
Mathematical Foundations of Computer...
