Result 1 to 20 of 61 total
Hamiltonian cycles in Kneser graphs for n=2k+2 (English)
Electronic Notes in Discrete Mathematics 37, 291-296 (2011).
1
Complexity separating classes for edge-colouring and total-colouring (English)
J. Braz. Comp. Soc. 17, No. 4, 281-285 (2011).
2
Split clique graph complexity (English)
WG, 11-22 (2011).
3
Analysis and implementation of sorting by transpositions using permutation trees (English)
BSB, 42-49 (2011).
4
An evidence for Lovász conjecture about Hamiltonian paths and cycles. (English)
Mat. Contemp. 39, 121-128 (2010).
5
Complexity dichotomy on partial grid recognition. (English)
Comput. Res. Repos. 2010, Article No. 1006.3541 (2010).
6
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (English)
Electronic Notes in Discrete Mathematics 36, 391-398 (2010).
7
Total chromatic number of ${square, unichord}$-free graphs (English)
Electronic Notes in Discrete Mathematics 36, 671-678 (2010).
8
Bounds on the transposition distance for lonely permutations (English)
BSB, 35-46 (2010).
9
Chromatic index of chordless graphs (English)
CTW, 51-54 (2010).
10
Skew partition sandwich problem is NP-complete (English)
Electronic Notes in Discrete Mathematics 35, 9-14 (2009).
11
NP-completeness of determining the total chromatic number of graphs that do not contain a cycle with a unique chord (English)
CTW, 55-59 (2009).
12
An improved upper bound on the crossing number of the hypercube. (English)
J. Graph Theory 59, No. 2, 145-161 (2008).
13
The polynomial dichotomy for three nonempty part sandwich problems (English)
Electronic Notes in Discrete Mathematics 30, 81-86 (2008).
14
$2K_{2}$ vertex-set partition into nonempty parts (English)
Electronic Notes in Discrete Mathematics 30, 291-296 (2008).
15
Sufficient conditions for a graph to be edge-colorable with maximum degree colors (English)
Electronic Notes in Discrete Mathematics 30, 69-74 (2008).
16
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (English)
Electronic Notes in Discrete Mathematics 30, 147-152 (2008).
17
Helly property, clique graphs, complementary graph classes, and sandwich problems (English)
J. Braz. Comp. Soc. 14, No. 2, 45-52 (2008).
18
An improved upper bound on the crossing number of the hypercube (English)
Journal of Graph Theory 59, No. 2, 145-161 (2008).
19
On the toric graph as a tool to handle the problem of sorting by transpositions (English)
BSB, 79-91 (2008).
20
Result 1 to 20 of 61 total
Start
Contact
Print
General Help
