Result 1 to 20 of 28 total
Vertex Ramsey problems in the hypercube. (English)
SIAM J. Discrete Math. 26, No. 2, 838-853 (2012).
1
Minimum light numbers in the $σ$-game and lit-only $σ$-game on unicyclic and grid graphs. (English)
Electron. J. Comb. 18, No. 1, Research Paper P214, 27 p., electronic only (2011).
2
Does the lit-only restriction make any difference for the sigma-game and $sigma^{+}$-game? (English)
Eur. J. Comb. 30, No. 4, 774-787 (2009).
3
Maximum orbit weights in the sigma-game and lit-only sigma-game on grids and graphs (English)
Graphs and Combinatorics 25, No. 3, 309-326 (2009).
4
Tight bounds for eternal dominating sets in graphs. (English)
Discrete Math. 308, No. 12, 2589-2593 (2008).
5
Odd and even dominating sets with open neighborhoods. (English)
Ars Comb. 83, 229-247 (2007).
6
Total perfect codes in grid graphs. (English)
Bull. Inst. Comb. Appl. 46, 61-68 (2006).
7
Parity dominating sets in grid graphs. (English)
Congr. Numerantium 172, 79-95 (2005).
8
Erdős-ko-rado with conditions on the minimum complementary degree (English)
J. Comb. Theory, Ser. A 109, No. 1, 45-62 (2005).
9
Hall’s multicoloring condition and common partial systems of distinct representatives. (English)
J. Comb. Math. Comb. Comput. 44, 189-197 (2003).
10
Fibonacci polynomials and parity domination in grid graphs. (English)
Graphs Comb. 18, No.2, 271-283 (2002).
11
Restricted list coloring and Hall’s condition. (English)
Discrete Math. 249, No. 1-3, 57-63 (2002).
12
List multi-coloring problems. (English)
Bull. Inst. Comb. Appl. 34, 71-76 (2002).
13
Fibonacci polynomials and parity domination in grid graphs (English)
Graphs and Combinatorics 18, No. 2, 271-283 (2002).
14
Odd and residue domination numbers of a graph. (English)
Discuss. Math., Graph Theory 21, No.1, 119-136 (2001).
15
Uniquely edge-3-colorable graphs and snarks. (English)
Graphs Comb. 16, No.3, 257-267 (2000).
16
The scope of three colouring conjectures. (English)
J. Comb. Math. Comb. Comput. 32, 51-63 (2000).
17
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs. (English)
J. Graph Theory 33, No.4, 199-219 (2000).
18
Uniquely edge-3-colorable graphs and snarks (English)
Graphs and Combinatorics 16, No. 3, 257-267 (2000).
19
Permutation graphs and Petersen graph. (English)
Ars Comb. 51, 240-248 (1999).
20
Result 1 to 20 of 28 total
Start
Contact
Print
General Help
