Volume 465

Theoretical Computer Science

Volume 465
1

An algorithm to construct independent spanning trees on parity cubes

Wang, Yan, Fan, Jianxi, Jia, Xiaohua, Huang, He
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 532 KB
english, 2012
3

Corrigendum: “On Brlek–Reutenauer conjecture”

Balková, L’., Pelantová, E., Starosta, Š.
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 180 KB
english, 2012
4

Equitable colorings of planar graphs without short cycles

Nakprasit, Keaitsuda, Nakprasit, Kittikorn
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 241 KB
english, 2012
6

Matching preclusion for balanced hypercubes

Lü, Huazhong, Li, Xianyue, Zhang, Heping
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 480 KB
english, 2012
7

Linear time algorithms for two disjoint paths problems on directed acyclic graphs

Tholey, Torsten
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 646 KB
english, 2012
8

Analytical aspects of tie breaking

Jacobs, Tobias
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 231 KB
english, 2012
9

Editorial Board

Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 58 KB
english, 2012