[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || Graph Theoretic FoundationsGolumbic, Martin Charles · 2004

[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || Foreword 2004: The annals editionGolumbic, Martin Charles · 2004

[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || Acknowledgments, · 2004

[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || index, · 2004

[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || Copyright, · 2004

[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || Dedication, · 2004

[Annals of Discrete Mathematics] Algorithmic Graph Theory and Perfect Graphs Volume 57 || Appendix, · 2004

[North-Holland Mathematics Studies] Annals of Discrete Mathematics (20): Convexity and Graph Theory, Proceedings of the Conference on Convexity and Graph Theory Volume 87 || PrefaceRosenfeld, M. · 1984

Chessboard domination problemsE.J. Cockayne · 1990

Domination and irredundance in cubic graphsE.J. Cockayne; C.M. Mynhardt · 1997

Disjoint independent dominating sets in graphsE.J. Cockayne; S.T. Hedetniemi · 1976

Broadcasts and domination in treesE.J. Cockayne; S. Herke; C.M. Mynhardt · 2011

Universal maximal packing functions of graphsE.J. Cockayne; O. Favaron; C.M. Mynhardt · 1996

On i−-ER-critical graphsE.J. Cockayne; O. Favaron; C.M. Mynhardt · 2004

Balancing equal weights on the integer lineR.E. Odeh; E.J. Cockayne · 1969

Linear algorithms on recursive representations of treesS.L. Mitchell; E.J. Cockayne; S.T. Hedetniemi · 1979