Result 21 to 40 of 222 total
Updating the complexity status of coloring graphs without a fixed induced linear forest. (English)
Theor. Comput. Sci. 414, No. 1, 9-19 (2012).
21
Upper bounds on the order of nearly regular induced subgraphs in random graphs. (English)
An. Univ. Craiova, Ser. Mat. Inf. 38, No. 4, 44-49 (2011).
22
Rainbow induced subgraphs in proper vertex colorings. (English)
Fundam. Inform. 111, No. 4, 437-451 (2011).
23
The complexity of dissociation set problems in graphs. (English)
Discrete Appl. Math. 159, No. 13, 1352-1366 (2011).
24
Two forbidden induced subgraphs and well-quasi-ordering. (English)
Discrete Math. 311, No. 16, 1813-1822 (2011).
25
Bipartite induced subgraphs and well-quasi-ordering. (English)
J. Graph Theory 67, No. 3, 235-249 (2011).
26
Regular induced subgraphs of a random graph. (English)
Random Struct. Algorithms 38, No. 3, 235-250 (2011).
27
The three-in-a-tree problem. (English)
Combinatorica 30, No. 4, 387-417 (2010).
28
On posets with double bound graphs which contain a star graph as an induced subgraph. (English)
Southeast Asian Bull. Math. 34, No. 6, 1063-1075 (2010).
29
Max-cut and containment relations in graphs. (English)
Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28‒30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 15-26 (2010).
30
Forbidden subgraphs and the existence of a 2-factor. (English)
J. Graph Theory 64, No. 3, 250-266 (2010).
31
The effect of induced subgraphs on quasi-randomness. (English)
Random Struct. Algorithms 36, No. 1, 90-109 (2010).
32
Well-quasi-order of relabel functions. (English)
Order 27, No. 3, 301-315 (2010).
33
The $k$-in-a-tree problem for graphs of girth at least $k$. (English)
Discrete Appl. Math. 158, No. 15, 1644-1649 (2010).
34
On Seymour’s strengthening of Hadwiger’s conjecture for graphs with certain forbidden subgraphs. (English)
Discrete Math. 310, No. 20, 2714-2724 (2010).
35
Exact leaf powers. (English)
Theor. Comput. Sci. 411, No. 31-33, 2968-2977 (2010).
36
On the number of components of a graph. (English)
Contrib. Discrete Math. 5, No. 1, 34-58, electronic only (2010).
37
Large induced subgraphs with equated maximum degree. (English)
Discrete Math. 310, No. 4, 742-747 (2010).
38
Finding induced trees. (English)
Discrete Appl. Math. 157, No. 17, 3552-3557 (2009).
39
Parameterized graph cleaning problems. (English)
Discrete Appl. Math. 157, No. 15, 3258-3267 (2009).
40
Result 21 to 40 of 222 total
Start
Contact
Print
General Help
