Result 1 to 20 of 341 total
Small edge sets meeting all triangles of a graph. (English)
Graphs Comb. 28, No. 3, 381-392 (2012).
1
List colorings of $K_5$-minor-free graphs with special list assignments. (English)
J. Graph Theory 71, No. 1, 18-30 (2012).
2
Distance domination versus iterated domination. (English)
Discrete Math. 312, No. 17, 2672-2675 (2012).
3
Proper connection of graphs. (English)
Discrete Math. 312, No. 17, 2550-2560 (2012).
4
Vertex coloring without large polychromatic stars. (English)
Discrete Math. 312, No. 14, 2102-2108 (2012).
5
3-consecutive edge coloring of a graph. (English)
Discrete Math. 312, No. 3, 561-573 (2012).
6
Transversals and domination in uniform hypergraphs. (English)
Eur. J. Comb. 33, No. 1, 62-71 (2012).
7
Transversals and domination in uniform hypergraphs (English)
Eur. J. Comb. 33, No. 1, 62-72 (2012).
8
The most vital nodes with respect to independent set and vertex cover. (English)
Discrete Appl. Math. 159, No. 17, 1933-1946 (2011).
9
Maximum number of colors: C-coloring and related problems. (English)
J. Geom. 101, No. 1-2, 83-97 (2011).
10
The graph-bin packing problem. (English)
Int. J. Found. Comput. Sci. 22, No. 8, 1971-1993 (2011).
11
Optimal combinatorial batch codes derived from dual systems. (English)
Math. Notes, Miskolc 12, No. 1, 11-23 (2011).
12
Optimal batch codes: many items or low retrieval requirement. (English)
Adv. Math. Commun. 5, No. 3, 529-541 (2011).
13
Color-bounded hypergraphs. V: Host graphs and subdivisions. (English)
Discuss. Math., Graph Theory 31, No. 2, 223-238 (2011).
14
Complexity and approximation of the constrained forest problem. (English)
Theor. Comput. Sci. 412, No. 32, 4081-4091 (2011).
15
Complexity of most vital nodes for independent set in graphs related to tree structures. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 154-166 (2011).
16
Improper C-colorings of graphs. (English)
Discrete Appl. Math. 159, No. 4, 174-186 (2011).
17
Optimal guard sets and the Helly property. (English)
Eur. J. Comb. 32, No. 1, 28-32 (2011).
18
Optimal guard sets and the Helly property (English)
Eur. J. Comb. 32, No. 1, 28-32 (2011).
19
Color-bounded hypergraphs, V: Host graphs and subdivisions (English)
Discussiones Mathematicae Graph Theory 31, No. 2, 223-238 (2011).
20
Result 1 to 20 of 341 total
Start
Contact
Print
General Help
