On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- 作者Boštjan Brešar; Sandi Klavžar; Douglas F. Rall
- 卷第155卷
- 期第17期
- 印刷ISSN0166-218X
- 文件大小187.87KB
- 发表时间2007
- DOI10.1016/j.dam.2007.06.008
- 页码2303-2311
Efficient parallel recognition of cographsStavros D. Nikolopoulos; Leonidas Palios · 2005
Minimal separators in -sparse graphsStavros D. Nikolopoulos; Leonidas Palios · 2006
Detecting Holes and Antiholes in GraphsStavros D. Nikolopoulos; Leonidas Palios · Algorithmica · 2007
Join-Reachability Problems in Directed GraphsLoukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios · 2014
Parallel algorithms for P4-comparability graphsStavros D. Nikolopoulos; Leonidas Palios · 2004
An Optimal Parallel Co-Connectivity AlgorithmKa Wong Chong; Stavros D. Nikolopoulos; Leonidas Palios · Theory of Computing Systems · 2004
An -time certifying algorithm for recognizing HHD-free graphsStavros D. Nikolopoulos; Leonidas Palios · 2012
A fully dynamic algorithm for the recognition of -sparse graphsStavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos · 2012