Bert L. Hartnell - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2022

A characterization of well-indumatchable graphs having girth greater than sevenArthur S. Finbow, Bert L. Hartnell, Michael D. Plummer. DAM, 321:261-271, 2022. [doi]

2021

A new framework to approach Vizing's conjectureBostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall. dmgt, 41(3):749-762, 2021. [doi]

2020

On the structure of 4-regular planar well-covered graphsArthur S. Finbow, Bert L. Hartnell, Michael D. Plummer. DAM, 283:655-688, 2020. [doi]

2018

On Well-Covered Cartesian ProductsBert L. Hartnell, Douglas F. Rall, Kirsti Wash. gc, 34(6):1259-1268, 2018. [doi]

2017

Uniformly dissociated graphsBostjan Bresar, Bert L. Hartnell, Douglas F. Rall. arsmc, 13(2):293-306, 2017. [doi]

On well-covered pentagonalizations of the planeArthur S. Finbow, Bert L. Hartnell, Michael D. Plummer. DAM, 224:91-105, 2017. [doi]

2016

Well-covered triangulations: Part IVArthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer. DAM, 215:71-94, 2016. [doi]

2014

Independent protection in graphsBert L. Hartnell, Christina M. Mynhardt. DM, 335:100-109, 2014. [doi]

2008

Decycling sets in certain cartesian product graphs with one factor completeBert L. Hartnell, Carol A. Whitehead. ajc, 40:305, 2008. [doi]

2006

On graphs having uniform size star factorsBert L. Hartnell, Douglas F. Rall. ajc, 34:305-312, 2006. [doi]

1980

Optimal K-secure graphsGeorg Gunther, Bert L. Hartnell. DAM, 2(3):225-231, 1980. [doi]

1978

A linear algorithm for disjoint matchings in treesErnest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi. DM, 21(2):129-136, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL