Bert Hartnell Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArt S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part II. Discrete Applied Mathematics 157(13): 2799-2817 (2009)
2008
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall: Limited Packings in Graphs. Electronic Notes in Discrete Mathematics 30: 15-20 (2008)
2005
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell, Preben D. Vestergaard: Dominating sets with at most k components. Ars Comb. 74: (2005)
2004
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArt S. Finbow, Bert Hartnell: Well-located graphs: a collection of well-covered ones. Discrete Mathematics 276(1-3): 201-209 (2004)
2003
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArt S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part I. Discrete Applied Mathematics 132(1-3): 97-108 (2003)
2001
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRommel Barbosa, Bert Hartnell: Characterization of Zm-well-covered graphs for some classes of graphs. Discrete Mathematics 233(1-3): 293-297 (2001)
2000
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell: On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. Ars Comb. 55: (2000)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArt S. Finbow, Bert Hartnell: Well-located graphs: A collection of well-covered ones. Electronic Notes in Discrete Mathematics 5: 120-122 (2000)
1999
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell, Douglas F. Rall: A bound on the size of a graph with given order and bondage number. Discrete Mathematics 197-198: 409-413 (1999)
1997
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell: On The Local Structure Of Well-Covered Graphs Without 4-Cycles. Ars Comb. 45: (1997)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell, Carol Whitehead: On k-packings of graphs. Ars Comb. 47: (1997)
1996
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell, Michael D. Plummer: On 4-connected Claw-free Well-covered Graphs. Discrete Applied Mathematics 64(1): 57-65 (1996)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gunther, Bert Hartnell, Douglas F. Rall: Star-factors and k-bounded total domination. Networks 27(3): 197-201 (1996)
1994
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArt S. Finbow, Bert Hartnell, Carol Whitehead: A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. Discrete Mathematics 125(1-3): 153-167 (1994)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell, Douglas F. Rall: Bounds on the bondage number of a graph. Discrete Mathematics 128(1-3): 173-177 (1994)
1993
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gunther, Bert Hartnell, Douglas F. Rall: Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. Discrete Applied Mathematics 46(2): 167-172 (1993)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArt S. Finbow, Bert Hartnell, Richard J. Nowakowski: A Characterization of Well Covered Graphs of Girth 5 or Greater. J. Comb. Theory, Ser. B 57(1): 44-68 (1993)
1991
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Hartnell, William Kocay: On minimal neighbourhood-connected graphs. Discrete Mathematics 92(1-3): 95-105 (1991)
1977
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErnest J. Cockayne, Bert Hartnell: Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory, Ser. B 23(2-3): 174-183 (1977)

Coauthor Index

1Rommel Barbosa [14]
2Ernest J. Cockayne [1]
3Art S. Finbow [3] [6] [12] [15] [16] [19]
4Robert Gallant [18]
5Georg Gunther [4] [7] [18]
6William Kocay [2]
7Richard J. Nowakowski [3] [15] [19]
8Michael D. Plummer [8] [15] [19]
9Douglas F. Rall [4] [5] [7] [11] [18]
10Preben D. Vestergaard [17]
11Carol Whitehead [6] [9]

Colors in the list of coauthors

Copyright © Thu Dec 10 16:00:26 2009 by Michael Ley (ley@uni-trier.de)