Bert Hartnell - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2014

Paired versus double domination in K 1, r -free graphsPaul Dorbec, Bert Hartnell, Michael A. Henning. jco, 27(4):688-694, 2014. [doi]

2013

On the Cartesian Product of Non Well-Covered GraphsBert Hartnell, Douglas F. Rall. combinatorics, 20(2):21, 2013. [doi]

On Graphs Having Maximal Independent Sets of Exactly t Distinct CardinalitiesBert Hartnell, Douglas F. Rall. gc, 29(3):519-525, 2013. [doi]

2012

Vizing's conjecture: a survey and recent resultsBostjan Bresar, Paul Dorbec, Wayne Goddard, Bert Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall. jgt, 69(1):46-76, 2012. [doi]

2010

On well-covered triangulations: Part IIIArthur S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer. DAM, 158(8):894-912, 2010. [doi]

Well paired-dominated graphsShannon L. Fitzpatrick, Bert Hartnell. jco, 20(2):194-204, 2010. [doi]

A note on equimatchable graphsAllan Frendrup, Bert Hartnell, Preben D. Vestergaard. ajc, 46:185-190, 2010. [doi]

Limited packings in graphsRobert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall. DAM, 158(12):1357-1364, 2010. [doi]

2009

On well-covered triangulations: Part IIArt S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer. DAM, 157(13):2799-2817, 2009. [doi]

2008

Limited Packings in GraphsRobert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall. endm, 30:15-20, 2008. [doi]

2005

Dominating sets with at most k componentsBert Hartnell, Preben D. Vestergaard. arscom, 74, 2005.

2004

A game based on vertex-magic total labelingsE. Boudreau, Bert Hartnell, K. Schmeisser, J. Whiteley. ajc, 29:67-74, 2004. [doi]

Well-located graphs: a collection of well-covered onesArt S. Finbow, Bert Hartnell. DM, 276(1-3):201-209, 2004. [doi]

2Bert Hartnell, Douglas F. Rall. dmgt, 24(3):389-402, 2004. [doi]

2003

On well-covered triangulations: Part IArt S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer. DAM, 132(1-3):97-108, 2003. [doi]

Improving some bounds for dominating Cartesian productsBert Hartnell, Douglas F. Rall. dmgt, 23(2):261-272, 2003. [doi]

2001

Characterization of ::::Z::::::m::-well-covered graphs for some classes of graphsRommel Barbosa, Bert Hartnell. DM, 233(1-3):293-297, 2001. [doi]

2000

m-well-covered graphs of girth 6 or moreYair Caro, Bert Hartnell. jgt, 33(4):246-255, 2000. [doi]

Well-located graphs: A collection of well-covered onesArt S. Finbow, Bert Hartnell. endm, 5:120-122, 2000. [doi]

On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain GraphsBert Hartnell. arscom, 55, 2000.

1999

A bound on the size of a graph with given order and bondage numberBert Hartnell, Douglas F. Rall. DM, 197-198:409-413, 1999. [doi]

1998

Paired-dominationShannon L. Fitzpatrick, Bert Hartnell. dmgt, 18(1):63-72, 1998. [doi]

1997

On k-packings of graphsBert Hartnell, Carol Whitehead. arscom, 47, 1997.

On The Local Structure Of Well-Covered Graphs Without 4-CyclesBert Hartnell. arscom, 45, 1997.

1996

Star-factors and k-bounded total dominationGeorg Gunther, Bert Hartnell, Douglas F. Rall. networks, 27(3):197-201, 1996. [doi]

On 4-connected Claw-free Well-covered GraphsBert Hartnell, Michael D. Plummer. DAM, 64(1):57-65, 1996. [doi]

1995

A characterization of parity graphs containing no cycle of order five or lessArt S. Finbow, Bert Hartnell. arscom, 40, 1995.

Vizing's conjecture and the one-half argumentBert Hartnell, Douglas F. Rall. dmgt, 15(2):205-216, 1995. [doi]

1994

A characterization of graphs of girth eight or more with exactly two sizes of maximal independent setsArt S. Finbow, Bert Hartnell, Carol Whitehead. DM, 125(1-3):153-167, 1994. [doi]

A characterization of well-covered graphs that contain neither 4- nor 5-cyclesArt Stephen Finbow, Bert Hartnell, Richard J. Nowakowski. jgt, 18(7):713-721, 1994. [doi]

Bounds on the bondage number of a graphBert Hartnell, Douglas F. Rall. DM, 128(1-3):173-177, 1994. [doi]

1993

A Characterization of Well Covered Graphs of Girth 5 or GreaterArt S. Finbow, Bert Hartnell, Richard J. Nowakowski. JCT, 57(1):44-68, 1993. [doi]

Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of DeletionGeorg Gunther, Bert Hartnell, Douglas F. Rall. DAM, 46(2):167-172, 1993. [doi]

1991

On minimal neighbourhood-connected graphsBert Hartnell, William Kocay. DM, 92(1-3):95-105, 1991. [doi]

1989

On designing a network to defend against random attacks of radius twoArt S. Finbow, Bert Hartnell. networks, 19(7):771-792, 1989. [doi]

1987

Neighbor-connected graphs and projective planesGeorg Gunther, Bert Hartnell, Richard J. Nowakowski. networks, 17(2):241-247, 1987. [doi]

1977

Edge partitions of complete multipartite graphs into equal length circuitsErnest J. Cockayne, Bert Hartnell. JCT, 23(2-3):174-183, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL