Skip to main content

Journal of Combinatorial Optimization

Ausgabe 4/2013

Special Issue: Optimization in Graphs

Inhalt (21 Artikel)

Preface: optimization in graphs

D. J. Guan, Ko-Wei Lih, Xuding Zhu

Equivalence of two conjectures on equitable coloring of graphs

Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen

The decycling number of outerplanar graphs

Huilan Chang, Hung-Lin Fu, Min-Yun Lien

(p,q)-total labeling of complete graphs

Ma-Lian Chia, David Kuo, Jing-Ho Yan, Siou-Ru Yang

Acyclic edge coloring of planar graphs without 4-cycles

Weifan Wang, Qiaojun Shu, Yiqiao Wang

The partition method for poset-free families

Jerrold R. Griggs, Wei-Tian Li

A note on optimal pebbling of hypercubes

Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue

The broadcast median problem in heterogeneous postal model

Cheng-Hsiao Tsou, Gen-Huey Chen, Hung-I Yu, Ching-Chi Lin

Three conjectures on the signed cycle domination in graphs

Jian Guan, Xiaoyan Liu, Changhong Lu, Zhengke Miao

L(p,q)-labeling of sparse graphs

Clément Charpentier, Mickaël Montassier, André Raspaud

Distance two edge labelings of lattices

Wensong Lin, Jianzhuan Wu

The hamiltonian numbers in digraphs

Ting-Pang Chang, Li-Da Tong

Some results on the target set selection problem

Chun-Ying Chiang, Liang-Hao Huang, Bo-Jr Li, Jiaojiao Wu, Hong-Gwa Yeh

The game Grundy number of graphs

Frédéric Havet, Xuding Zhu

Premium Partner