Preface

• Editor-in-Chief Lecture
• PDF 306.04 K

Paired-Domination Game Played in Graphs

Pages 79-94

10.22049/cco.2019.26437.1110

M.A. Henning; Teresa W. Haynes

• View Article
• PDF 403.97 K

A characterization of trees with equal Roman {2}-domination and Roman domination numbers

Pages 95-107

10.22049/cco.2019.26364.1103

Ismael Gonzalez Yero; Abel Cabrera Martinez

• View Article
• PDF 383.97 K

k-Efficient partitions of graphs

Pages 109-122

10.22049/cco.2019.26446.1112

M Chellali; Teresa W. Haynes; Stephen T. Hedetniemi

• View Article
• PDF 419.76 K

t-Pancyclic Arcs in Tournaments

Pages 123-130

10.22049/cco.2019.26333.1097

Wei Meng; Steffen Grueter; Yubao Guo; Manu Kapolke; Simon Meesker

• View Article
• PDF 354.83 K

Girth, minimum degree, independence, and broadcast independence

Pages 131-139

10.22049/cco.2019.26346.1098

Stephane Bessy; Dieter Rautenbach

• View Article
• PDF 395.24 K

On the edge-connectivity of C_4-free graphs

Pages 141-150

10.22049/cco.2019.26453.1113

Peter Dankelmann

• View Article
• PDF 363.55 K

Different-Distance Sets in a Graph

Pages 151-171

10.22049/cco.2019.26467.1115

Jason T. Hedetniemi; Stephen T. Hedetniemi; Renu C. Renu C. Laskar; Henry Martyn Mulder

• View Article
• PDF 586.58 K

Directed domination in oriented hypergraphs

Pages 173-183

10.22049/cco.2019.26466.1114

Yair Caro; Adriana Hansberg

• View Article
• PDF 372.41 K

On trees with equal Roman domination and outer-independent Roman domination numbers

Pages 185-199

10.22049/cco.2019.26319.1095

Seyed Mahmoud Sheikholeslami; Sakineh Nazari-Moghaddam

• View Article
• PDF 400.74 K

On Hop Roman Domination in Trees

Pages 201-208

10.22049/cco.2019.26469.1116

Nader Jafari Rad; Abolfazl Poureidi

• View Article
• PDF 436.42 K