Result 1 to 20 of 29 total
Coloring Eulerian triangulations of the Klein bottle. (English)
Graphs Comb. 28, No. 4, 499-530 (2012).
1
5-coloring graphs with 4 crossings. (English)
SIAM J. Discrete Math. 25, No. 1, 401-422 (2011).
2
Markov bases of binary graph models of $K_{4}$-minor free graphs. (English)
J. Comb. Theory, Ser. A 117, No. 6, 759-765 (2010).
3
Pattern hypergraphs. (English)
Electron. J. Comb. 17, No. 1, Research Paper R15, 20 p. (2010).
4
Markov bases of binary graph models of $K_{4}$-minor free graphs (English)
J. Comb. Theory, Ser. A 117, No. 6, 759-765 (2010).
5
Length-bounded cuts and flows (English)
ACM Transactions on Algorithms 7, No. 1, 4 (2010).
6
On the complexity of paths avoiding forbidden pairs. (English)
Discrete Appl. Math. 157, No. 13, 2871-2876 (2009).
7
Long cycles in fullerene graphs. (English)
J. Math. Chem. 45, No. 4, 1021-1031 (2009).
8
Projective, affine, and abelian colorings of cubic graphs. (English)
Eur. J. Comb. 30, No. 1, 53-69 (2009).
9
Projective, affine, and Abelian colorings of cubic graphs (English)
Eur. J. Comb. 30, No. 1, 53-69 (2009).
10
Perfect matching preservers. (English)
Electron. J. Comb. 13, No. 1, Research paper R95, 15 p. (2006).
11
Perfect matching preservers (English)
Electr. J. Comb. 13, No. 1 (2006).
12
An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems. (English)
Jędrzejowicz, Joanna (ed.) et al., Mathematical foundations of computer science 2005. 30th international symposium, MFCS 2005, Gdansk, Poland, August 29‒September 2, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28702-7/pbk). Lecture Notes in Computer Science 3618, 603-614 (2005).
13
Locally consistent constraint satisfaction problems. (English)
Theor. Comput. Sci. 348, No. 2-3, 187-206 (2005).
14
A note on group colorings. (English)
J. Graph Theory 50, No. 2, 123-129 (2005).
15
A note on group colorings (English)
Journal of Graph Theory 50, No. 2, 123-129 (2005).
16
An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems (English)
MFCS, 603-614 (2005).
17
Locally consistent constraint satisfaction problems. (English)
Electron. Colloq. Comput. Complex. 2004, Article No. 051 (2004).
18
An algorithm for cyclic edge connectivity of cubic graphs (extended abstract). (English)
Hagerup, Torben (ed.) et al., Algorithm theory ‒ SWAT 2004. 9th Scandinavian workshop on algorithm theory, Humlebæk, Denmark, July 8‒10, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22339-8/pbk). Lecture Notes in Computer Science 3111, 236-247 (2004).
19
Locally consistent constraint satisfaction problems (extended abstract). (English)
Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12‒16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 469-480 (2004).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
