Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Johannes H. Hattingh
@article{DBLP:journals/dm/HattinghJ18,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {Some multicolor bipartite Ramsey numbers involving cycles and a small
number of colors},
journal = {Discret. Math.},
volume = {341},
number = {5},
pages = {1325--1330},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.02.006},
doi = {10.1016/J.DISC.2018.02.006},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DorflingHJ17,
author = {Michael Dorfling and
Johannes H. Hattingh and
Elizabeth Jonck},
title = {Total domination in maximal outerplanar graphs},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {506--511},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.10.020},
doi = {10.1016/J.DAM.2016.10.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DorflingHJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DorflingHJ16,
author = {Michael Dorfling and
Johannes H. Hattingh and
Elizabeth Jonck},
title = {Total domination in maximal outerplanar graphs {II}},
journal = {Discret. Math.},
volume = {339},
number = {3},
pages = {1180--1188},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.11.003},
doi = {10.1016/J.DISC.2015.11.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DorflingHJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HattinghSMW16,
author = {Johannes H. Hattingh and
Osama A. Saleh and
Lucas C. van der Merwe and
Terry J. Walters},
title = {Nordhaus-Gaddum Results for the Induced Path Number of a Graph When
Neither the Graph Nor Its Complement Contains Isolates},
journal = {Graphs Comb.},
volume = {32},
number = {3},
pages = {987--996},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1629-z},
doi = {10.1007/S00373-015-1629-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HattinghSMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HattinghJ16,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {Equality in a bound that relates the size and the restrained domination
number of a graph},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1586--1608},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9843-4},
doi = {10.1007/S10878-015-9843-4},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HattinghJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HattinghJ14,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {Some Bistar Bipartite Ramsey Numbers},
journal = {Graphs Comb.},
volume = {30},
number = {5},
pages = {1175--1181},
year = {2014},
url = {https://doi.org/10.1007/s00373-013-1339-3},
doi = {10.1007/S00373-013-1339-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HattinghJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghRJLMM12,
author = {Johannes H. Hattingh and
Nader Jafari Rad and
Sayyed Heidar Jafari and
Marc Loizeaux and
John Matthews and
Lucas C. van der Merwe},
title = {Total edge critical graphs with leaves},
journal = {Discret. Math.},
volume = {312},
number = {24},
pages = {3482--3488},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.09.001},
doi = {10.1016/J.DISC.2012.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghRJLMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HattinghSMW12,
author = {Johannes H. Hattingh and
Osama A. Saleh and
Lucas C. van der Merwe and
Terry J. Walters},
title = {A Nordhaus-Gaddum-type result for the induced path number},
journal = {J. Comb. Optim.},
volume = {24},
number = {3},
pages = {329--338},
year = {2012},
url = {https://doi.org/10.1007/s10878-011-9388-0},
doi = {10.1007/S10878-011-9388-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HattinghSMW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HattinghJ11,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {Restrained domination in cubic graphs},
journal = {J. Comb. Optim.},
volume = {22},
number = {2},
pages = {166--179},
year = {2011},
url = {https://doi.org/10.1007/s10878-009-9281-2},
doi = {10.1007/S10878-009-9281-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HattinghJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HattinghP10,
author = {Johannes H. Hattingh and
Andrew R. Plummer},
title = {A Note on Restrained Domination in Trees},
journal = {Ars Comb.},
volume = {94},
year = {2010},
timestamp = {Wed, 06 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HattinghP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HattinghJJ10,
author = {Johannes H. Hattingh and
Elizabeth Jonck and
Ernst J. Joubert},
title = {Bounds on the Total Restrained Domination Number of a Graph},
journal = {Graphs Comb.},
volume = {26},
number = {1},
pages = {77--93},
year = {2010},
url = {https://doi.org/10.1007/s00373-010-0894-0},
doi = {10.1007/S00373-010-0894-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HattinghJJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HattinghJJ10,
author = {Johannes H. Hattingh and
Elizabeth Jonck and
Ernst J. Joubert},
title = {An upper bound on the total restrained domination number of a tree},
journal = {J. Comb. Optim.},
volume = {20},
number = {3},
pages = {205--223},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9204-7},
doi = {10.1007/S10878-008-9204-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HattinghJJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghJR09,
author = {Johannes H. Hattingh and
Elizabeth Jonck and
Charl J. Ras},
title = {A class of full (d, 1)-colorable trees},
journal = {Australas. {J} Comb.},
volume = {45},
pages = {277--290},
year = {2009},
url = {http://ajc.maths.uq.edu.au/pdf/45/ajc\_v45\_p277.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghJR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HattinghJ09,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {An upper bound for the restrained domination number of a graph with
minimum degree at least two in terms of order and minimum degree},
journal = {Discret. Appl. Math.},
volume = {157},
number = {13},
pages = {2846--2858},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2009.03.010},
doi = {10.1016/J.DAM.2009.03.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HattinghJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HattinghH09,
author = {Johannes H. Hattingh and
Michael A. Henning},
title = {Bounds relating the weakly connected domination number to the total
domination number and the matching number},
journal = {Discret. Appl. Math.},
volume = {157},
number = {14},
pages = {3086--3093},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2009.06.008},
doi = {10.1016/J.DAM.2009.06.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HattinghH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JonckHR09,
author = {Elizabeth Jonck and
Johannes H. Hattingh and
Charl J. Ras},
title = {A characterization of lambda\({}_{\mbox{d, 1}}\)-minimal trees and
other attainable classes},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {2340--2348},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.05.009},
doi = {10.1016/J.DISC.2008.05.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JonckHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HattinghJLPM09,
author = {Johannes H. Hattingh and
Ernst J. Joubert and
Marc Loizeaux and
Andrew R. Plummer and
Lucas C. van der Merwe},
title = {Restrained domination in unicyclic graphs},
journal = {Discuss. Math. Graph Theory},
volume = {29},
number = {1},
pages = {71--86},
year = {2009},
url = {https://doi.org/10.7151/dmgt.1433},
doi = {10.7151/DMGT.1433},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HattinghJLPM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HattinghJ09,
author = {Johannes H. Hattingh and
Ernst J. Joubert},
title = {Restrained Domination in Claw-Free Graphs with Minimum Degree at Least
Two},
journal = {Graphs Comb.},
volume = {25},
number = {5},
pages = {693--706},
year = {2009},
url = {https://doi.org/10.1007/s00373-010-0883-3},
doi = {10.1007/S00373-010-0883-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HattinghJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/XingHP08,
author = {Hua{-}ming Xing and
Johannes H. Hattingh and
Andrew R. Plummer},
title = {On the domination number of Hamiltonian graphs with minimum degree
six},
journal = {Appl. Math. Lett.},
volume = {21},
number = {10},
pages = {1037--1040},
year = {2008},
url = {https://doi.org/10.1016/j.aml.2007.10.023},
doi = {10.1016/J.AML.2007.10.023},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/XingHP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HattinghH08,
author = {Johannes H. Hattingh and
Michael A. Henning},
title = {Restrained Domination Excellent Trees},
journal = {Ars Comb.},
volume = {87},
year = {2008},
timestamp = {Wed, 26 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HattinghH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghJJP08,
author = {Johannes H. Hattingh and
Elizabeth Jonck and
Ernst J. Joubert and
Andrew R. Plummer},
title = {Nordhaus-Gaddum results for restrained domination and total restrained
domination in graphs},
journal = {Discret. Math.},
volume = {308},
number = {7},
pages = {1080--1087},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.03.061},
doi = {10.1016/J.DISC.2007.03.061},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghJJP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghP08,
author = {Johannes H. Hattingh and
Andrew R. Plummer},
title = {Restrained bondage in graphs},
journal = {Discret. Math.},
volume = {308},
number = {23},
pages = {5446--5453},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.10.016},
doi = {10.1016/J.DISC.2007.10.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghJJP07,
author = {Johannes H. Hattingh and
Elizabeth Jonck and
Ernst J. Joubert and
Andrew R. Plummer},
title = {Total restrained domination in trees},
journal = {Discret. Math.},
volume = {307},
number = {13},
pages = {1643--1650},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2006.09.014},
doi = {10.1016/J.DISC.2006.09.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghJJP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DankelmannDHHMS07,
author = {Peter Dankelmann and
David P. Day and
Johannes H. Hattingh and
Michael A. Henning and
Lisa R. Markus and
Henda C. Swart},
title = {On equality in an upper bound for the restrained and total domination
numbers of a graph},
journal = {Discret. Math.},
volume = {307},
number = {22},
pages = {2845--2852},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2007.03.003},
doi = {10.1016/J.DISC.2007.03.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DankelmannDHHMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HarrisHH06,
author = {Laura M. Harris and
Johannes H. Hattingh and
Michael A. Henning},
title = {Total k-subdominating functions on graphs},
journal = {Australas. {J} Comb.},
volume = {35},
pages = {141--154},
year = {2006},
url = {http://ajc.maths.uq.edu.au/pdf/35/ajc\_v35\_p141.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HarrisHH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HarrisHH06a,
author = {Laura M. Harris and
Johannes H. Hattingh and
Michael A. Henning},
title = {Algorithmic aspects of minus total k-subdomination in graphs},
journal = {Australas. {J} Comb.},
volume = {36},
pages = {101--112},
year = {2006},
url = {http://ajc.maths.uq.edu.au/pdf/36/ajc\_v36\_p101.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HarrisHH06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HarrisHH06,
author = {Laura M. Harris and
Johannes H. Hattingh and
Michael A. Henning},
title = {Algorithmic aspects of total k-subdomination in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {26},
number = {1},
pages = {5--18},
year = {2006},
url = {https://doi.org/10.7151/dmgt.1296},
doi = {10.7151/DMGT.1296},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HarrisHH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/DankelmannHHS06,
author = {Peter Dankelmann and
Johannes H. Hattingh and
Michael A. Henning and
Henda C. Swart},
title = {Trees with Equal Domination and Restrained Domination Numbers},
journal = {J. Glob. Optim.},
volume = {34},
number = {4},
pages = {597--607},
year = {2006},
url = {https://doi.org/10.1007/s10898-005-8565-z},
doi = {10.1007/S10898-005-8565-Z},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/DankelmannHHS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DorflingGHH05,
author = {Michael Dorfling and
Wayne Goddard and
Johannes H. Hattingh and
Michael A. Henning},
title = {Augmenting a graph of minimum degree 2 to have two disjoint total
dominating sets},
journal = {Discret. Math.},
volume = {300},
number = {1-3},
pages = {82--90},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.06.020},
doi = {10.1016/J.DISC.2005.06.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DorflingGHH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DomkeHM05,
author = {Gayla S. Domke and
Johannes H. Hattingh and
Lisa R. Markus},
title = {On weakly connected domination in graphs {II}},
journal = {Discret. Math.},
volume = {305},
number = {1-3},
pages = {112--122},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.10.006},
doi = {10.1016/J.DISC.2005.10.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DomkeHM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HarrisH04,
author = {Laura M. Harris and
Johannes H. Hattingh},
title = {The algorithmic complexity of certain functional variations of total
domination in graphs},
journal = {Australas. {J} Comb.},
volume = {29},
pages = {143--156},
year = {2004},
url = {http://ajc.maths.uq.edu.au/pdf/29/ajc\_v29\_p143.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HarrisH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DankelmannDGGHS04,
author = {Peter Dankelmann and
Gayla S. Domke and
Wayne Goddard and
Paul J. P. Grobler and
Johannes H. Hattingh and
Henda C. Swart},
title = {Maximum sizes of graphs with given domination parameters},
journal = {Discret. Math.},
volume = {281},
number = {1-3},
pages = {137--148},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.07.010},
doi = {10.1016/J.DISC.2003.07.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DankelmannDGGHS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DomkeHMU02,
author = {Gayla S. Domke and
Johannes H. Hattingh and
Lisa R. Markus and
Elna Ungerer},
title = {On parameters related to strong and weak domination in graphs},
journal = {Discret. Math.},
volume = {258},
number = {1-3},
pages = {1--11},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(02)00257-1},
doi = {10.1016/S0012-365X(02)00257-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DomkeHMU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DomkeHHM00,
author = {Gayla S. Domke and
Johannes H. Hattingh and
Michael A. Henning and
Lisa R. Markus},
title = {Restrained domination in trees},
journal = {Discret. Math.},
volume = {211},
pages = {1--9},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00036-9},
doi = {10.1016/S0012-365X(99)00036-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DomkeHHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HattinghH00,
author = {Johannes H. Hattingh and
Michael A. Henning},
title = {Characterizations of trees with equal domination parameters},
journal = {J. Graph Theory},
volume = {34},
number = {2},
pages = {142--153},
year = {2000},
url = {https://doi.org/10.1002/1097-0118(200006)34:2\&\#60;142::AID-JGT3\&\#62;3.0.CO;2-V},
doi = {10.1002/1097-0118(200006)34:2\&\#60;142::AID-JGT3\&\#62;3.0.CO;2-V},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HattinghH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/DunbarHLM99,
author = {Jean E. Dunbar and
Johannes H. Hattingh and
Renu C. Laskar and
Lisa R. Markus},
title = {Domination Using Induced Cliques in Graphs},
journal = {Ars Comb.},
volume = {52},
year = {1999},
timestamp = {Mon, 24 Aug 2015 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/DunbarHLM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DomkeHHLM99,
author = {Gayla S. Domke and
Johannes H. Hattingh and
Stephen T. Hedetniemi and
Renu C. Laskar and
Lisa R. Markus},
title = {Restrained domination in graphs},
journal = {Discret. Math.},
volume = {203},
number = {1-3},
pages = {61--69},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)00016-3},
doi = {10.1016/S0012-365X(99)00016-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DomkeHHLM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghMU98,
author = {Johannes H. Hattingh and
Alice A. McRae and
Elna Ungerer},
title = {Minus k-subdomination in graphs {III}},
journal = {Australas. {J} Comb.},
volume = {17},
pages = {69--76},
year = {1998},
url = {http://ajc.maths.uq.edu.au/pdf/17/ocr-ajc-v17-p69.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghMU98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HattinghUH98,
author = {Johannes H. Hattingh and
Elna Ungerer and
Michael A. Henning},
title = {Partial signed domination in graphs},
journal = {Ars Comb.},
volume = {48},
year = {1998},
timestamp = {Fri, 09 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HattinghUH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HattinghL98,
author = {Johannes H. Hattingh and
Renu C. Laskar},
title = {On weak domination in graphs},
journal = {Ars Comb.},
volume = {49},
year = {1998},
timestamp = {Mon, 24 Aug 2015 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/HattinghL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BroereDH98,
author = {Izak Broere and
Jean E. Dunbar and
Johannes H. Hattingh},
title = {Minus k-subdomination in graphs},
journal = {Ars Comb.},
volume = {50},
year = {1998},
timestamp = {Fri, 09 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BroereDH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HattinghHW98,
author = {Johannes H. Hattingh and
Michael A. Henning and
Jacobus L. Walters},
title = {Distance irredundance in graphs: complexity issues},
journal = {Ars Comb.},
volume = {50},
year = {1998},
timestamp = {Fri, 09 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HattinghHW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghU98,
author = {Johannes H. Hattingh and
Elna Ungerer},
title = {The signed and minus k-subdomination numbers of comets},
journal = {Discret. Math.},
volume = {183},
number = {1-3},
pages = {141--152},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00051-4},
doi = {10.1016/S0012-365X(97)00051-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghU98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghH98,
author = {Johannes H. Hattingh and
Michael A. Henning},
title = {Star-path bipartite Ramsey numbers\({}^{\mbox{, }}\)},
journal = {Discret. Math.},
volume = {185},
number = {1-3},
pages = {255--258},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00205-7},
doi = {10.1016/S0012-365X(97)00205-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DunbarGHHM97,
author = {Jean E. Dunbar and
Jerrold W. Grossman and
Johannes H. Hattingh and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {On weakly connected domination in graphs},
journal = {Discret. Math.},
volume = {167-168},
pages = {261--269},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00233-6},
doi = {10.1016/S0012-365X(96)00233-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DunbarGHHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HattinghU97,
author = {Johannes H. Hattingh and
Elna Ungerer},
title = {Minus k-subdomination in graphs {II}},
journal = {Discret. Math.},
volume = {171},
number = {1-3},
pages = {141--151},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00003-9},
doi = {10.1016/S0012-365X(96)00003-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HattinghU97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneHHHM97,
author = {Ernest J. Cockayne and
Johannes H. Hattingh and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {Using maximality and minimality conditions to construct inequality
chains},
journal = {Discret. Math.},
volume = {176},
number = {1-3},
pages = {43--61},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00356-1},
doi = {10.1016/S0012-365X(96)00356-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneHHHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghHS95,
author = {Johannes H. Hattingh and
Michael A. Henning and
Peter J. Slater},
title = {The algorithmic complexity of signed domination in graphs},
journal = {Australas. {J} Comb.},
volume = {12},
pages = {101--112},
year = {1995},
url = {http://ajc.maths.uq.edu.au/pdf/12/ocr-ajc-v12-p101.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghHS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroereHHM95,
author = {Izak Broere and
Johannes H. Hattingh and
Michael A. Henning and
Alice A. McRae},
title = {Majority domination in graphs},
journal = {Discret. Math.},
volume = {138},
number = {1-3},
pages = {125--135},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00194-N},
doi = {10.1016/0012-365X(94)00194-N},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroereHHM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghHS94,
author = {Johannes H. Hattingh and
Michael A. Henning and
Peter J. Slater},
title = {Three-valued k-neighborhood domination in graphs},
journal = {Australas. {J} Comb.},
volume = {9},
pages = {233--242},
year = {1994},
url = {http://ajc.maths.uq.edu.au/pdf/9/ocr-ajc-v9-p233.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghHS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghHW93,
author = {Johannes H. Hattingh and
Michael A. Henning and
Jakobus L. Walters},
title = {On the computational complexity of upper distance fractional domination},
journal = {Australas. {J} Comb.},
volume = {7},
pages = {133--144},
year = {1993},
url = {http://ajc.maths.uq.edu.au/pdf/7/ocr-ajc-v7-p133.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghHW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/BarnardEH93,
author = {Andries Barnard and
E. M. Ehlers and
Johannes H. Hattingh},
title = {Structure graphs and structure graph grammars},
journal = {Inf. Sci.},
volume = {73},
number = {3},
pages = {235--271},
year = {1993},
url = {https://doi.org/10.1016/0020-0255(93)90102-R},
doi = {10.1016/0020-0255(93)90102-R},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isci/BarnardEH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChenHR93,
author = {Guantao Chen and
Johannes H. Hattingh and
Cecil C. Rousseau},
title = {Asymptotic bounds for irredundant and mixed Ramsey numbers},
journal = {J. Graph Theory},
volume = {17},
number = {2},
pages = {193--206},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170208},
doi = {10.1002/JGT.3190170208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChenHR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hattingh90,
author = {Johannes H. Hattingh},
title = {On irredundant Ramsey numbers for graphs},
journal = {J. Graph Theory},
volume = {14},
number = {4},
pages = {437--441},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140407},
doi = {10.1002/JGT.3190140407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hattingh90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
