Michael A. Henning

According to our database1, Michael A. Henning authored at least 368 papers between 1992 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number.
J. Graph Theory, 2021

Bounds on the semipaired domination number of graphs with minimum degree at least two.
J. Comb. Optim., 2021

Zero forcing versus domination in cubic graphs.
J. Comb. Optim., 2021

Affine Planes and Transversals in 3-Uniform Linear Hypergraphs.
Graphs Comb., 2021

Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph.
Graphs Comb., 2021

Independent Domination Subdivision in Graphs.
Graphs Comb., 2021

Minimal graphs with disjoint dominating and paired-dominating sets.
Discuss. Math. Graph Theory, 2021

Restrained domination in self-complementary graphs.
Discuss. Math. Graph Theory, 2021

A new framework to approach Vizing's conjecture.
Discuss. Math. Graph Theory, 2021

Bounding and approximating minimum maximal matchings in regular graphs.
Discret. Math., 2021

Perfect Italian domination in cographs.
Appl. Math. Comput., 2021

2020
Algorithmic aspects of upper paired-domination in graphs.
Theor. Comput. Sci., 2020

Complexity and Algorithms for Semipaired Domination in Graphs.
Theory Comput. Syst., 2020

Bounds on upper transversals in hypergraphs.
J. Comb. Optim., 2020

Algorithmic results on double Roman domination in graphs.
J. Comb. Optim., 2020

Algorithm and hardness results on hop domination in graphs.
Inf. Process. Lett., 2020

Trees with Unique Minimum Semitotal Dominating Sets.
Graphs Comb., 2020

Equating <i>k</i> maximum degrees in graphs without short cycles.
Discuss. Math. Graph Theory, 2020

Total forcing sets and zero forcing sets in trees.
Discuss. Math. Graph Theory, 2020

Domination versus independent domination in graphs of small regularity.
Discret. Math., 2020

2-limited broadcast domination in subcubic graphs.
Discret. Appl. Math., 2020

Maker-Breaker total domination game.
Discret. Appl. Math., 2020

A 34-approximation of Vizing's conjecture for claw-free graphs.
Discret. Appl. Math., 2020

Total domination cover rubbling.
Discret. Appl. Math., 2020

Domination versus edge domination.
Discret. Appl. Math., 2020

Semipaired Domination in Some Subclasses of Chordal Graphs.
CoRR, 2020

Independent Domination in Subcubic Graphs.
CoRR, 2020

Traceability of connected domination critical graphs.
Appl. Math. Comput., 2020

Independent domination, colorings and the fractional idomatic number of a graph.
Appl. Math. Comput., 2020

2019
Algorithmic aspects of semitotal domination in graphs.
Theor. Comput. Sci., 2019

Semipaired domination in maximal outerplanar graphs.
J. Comb. Optim., 2019

A new lower bound on the domination number of a graph.
J. Comb. Optim., 2019

Independent Domination in Bipartite Cubic Graphs.
Graphs Comb., 2019

Upper transversals in hypergraphs.
Eur. J. Comb., 2019

On the maximum number of minimum total dominating sets in forests.
Discret. Math. Theor. Comput. Sci., 2019

Graphs with large semipared domination number.
Discuss. Math. Graph Theory, 2019

On accurate domination in graphs.
Discuss. Math. Graph Theory, 2019

On independent domination in planar, cubic graphs.
Discuss. Math. Graph Theory, 2019

A note on improved upper bounds on the transversal number of hypergraphs.
Discret. Math. Algorithms Appl., 2019

Cutting lemma and union lemma for the domination game.
Discret. Math., 2019

A characterization of double Roman trees.
Discret. Appl. Math., 2019

Perfect Italian domination in trees.
Discret. Appl. Math., 2019

Uniquely restricted matchings in subcubic graphs.
Discret. Appl. Math., 2019

On the total forcing number of a graph.
Discret. Appl. Math., 2019

A characterization of graphs with disjoint total dominating sets.
Ars Math. Contemp., 2019

Total forcing versus total domination in cubic graphs.
Appl. Math. Comput., 2019

2018
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.
SIAM J. Discret. Math., 2018

Tight lower bounds on the matching number in a graph with given maximum degree.
J. Graph Theory, 2018

Thoroughly dispersed colorings.
J. Graph Theory, 2018

Smallest domination number and largest independence number of graphs and forests with given degree sequence.
J. Graph Theory, 2018

Perfect graphs involving semitotal and semipaired domination.
J. Comb. Optim., 2018

A note on domination and total domination in prisms.
J. Comb. Optim., 2018

Semipaired Domination in Claw-Free Cubic Graphs.
Graphs Comb., 2018

Bounds on the Connected Forcing Number of a Graph.
Graphs Comb., 2018

Total Forcing and Zero Forcing in Claw-Free Cubic Graphs.
Graphs Comb., 2018

Total Domination Versus Domination in Cubic Graphs.
Graphs Comb., 2018

Hereditary equality of domination and exponential domination.
Discuss. Math. Graph Theory, 2018

Domination parameters of a graph and its complement.
Discuss. Math. Graph Theory, 2018

Total domination in versus paired-domination in regular graphs.
Discuss. Math. Graph Theory, 2018

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs.
Discret. Math., 2018

Independent domination in subcubic graphs of girth at least six.
Discret. Math., 2018

k-broadcast domination and k-multipacking.
Discret. Appl. Math., 2018

Game total domination critical graphs.
Discret. Appl. Math., 2018

Perfect Roman domination in trees.
Discret. Appl. Math., 2018

Total domination stability in graphs.
Discret. Appl. Math., 2018

Essential upper bounds on the total domination number.
Discret. Appl. Math., 2018

The matcher game played in graphs.
Discret. Appl. Math., 2018

On upper bounds for the independent transversal domination number.
Discret. Appl. Math., 2018

On Upper Transversals in 3-Uniform Hypergraphs.
Electron. J. Comb., 2018

A New Lower Bound on the Total Domination Number of a Tree.
Ars Comb., 2018

2017
Distance domination in graphs with given minimum and maximum degree.
J. Comb. Optim., 2017

The game total domination problem is log-complete in PSPACE.
Inf. Process. Lett., 2017

On 2-Step and Hop Dominating Sets in Graphs.
Graphs Comb., 2017

Edge Weighting Functions on Semitotal Dominating Sets.
Graphs Comb., 2017

Bounds on the game transversal number in hypergraphs.
Eur. J. Comb., 2017

A characterization of trees with equal 2-domination and 2-independence numbers.
Discret. Math. Theor. Comput. Sci., 2017

Domination game: extremal families for 3/5-conjecture for forests.
Discuss. Math. Graph Theory, 2017

A note on fractional disjoint transversals in hypergraphs.
Discret. Math., 2017

Matchings, path covers and domination.
Discret. Math., 2017

Location-domination in line graphs.
Discret. Math., 2017

Relating domination, exponential domination, and porous exponential domination.
Discret. Optim., 2017

Trees with equal total domination and game total domination numbers.
Discret. Appl. Math., 2017

Italian domination in trees.
Discret. Appl. Math., 2017

Partitioning the vertices of a cubic graph into two total dominating sets.
Discret. Appl. Math., 2017

Transversals and Independence in Linear Hypergraphs with Maximum Degree Two.
Electron. J. Comb., 2017

(Total) Domination in Prisms.
Electron. J. Comb., 2017

The 4/5 upper bound on the game total domination number.
Comb., 2017

Bounds for the $m$-Eternal Domination Number of a Graph.
Contributions Discret. Math., 2017

Lower Bounds on the Distance Domination Number of a Graph.
Contributions Discret. Math., 2017

2016
Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two.
SIAM J. Discret. Math., 2016

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.
SIAM J. Discret. Math., 2016

The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3.
J. Graph Theory, 2016

Disjunctive total domination in graphs.
J. Comb. Optim., 2016

Lower bounds on the total domination number of a graph.
J. Comb. Optim., 2016

Signed Roman k-Domination in Graphs.
Graphs Comb., 2016

Induced Cycles in Graphs.
Graphs Comb., 2016

Bounds on the disjunctive total domination number of a tree.
Discuss. Math. Graph Theory, 2016

Vertices contained in all or in no minimum semitotal dominating set of a tree.
Discuss. Math. Graph Theory, 2016

A characterization of hypergraphs with large domination number.
Discuss. Math. Graph Theory, 2016

A note on non-dominating set partitions in graphs.
Discuss. Math. Graph Theory, 2016

Progress towards the total domination game -conjecture.
Discret. Math., 2016

Location-domination and matching in cubic graphs.
Discret. Math., 2016

Independence in 5-uniform hypergraphs.
Discret. Math., 2016

Total dominating sequences in graphs.
Discret. Math., 2016

Trees with large m-eternal domination number.
Discret. Appl. Math., 2016

Induced 2-regular subgraphs in k-chordal cubic graphs.
Discret. Appl. Math., 2016

Largest domination number and smallest independence number of forests with given degree sequence.
Discret. Appl. Math., 2016

Locating-dominating sets in twin-free graphs.
Discret. Appl. Math., 2016

Game total domination for cycles and paths.
Discret. Appl. Math., 2016

Transversals in 4-Uniform Hypergraphs.
Electron. J. Comb., 2016

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture.
Electron. J. Comb., 2016

2015
Total Transversals in Hypergraphs and Their Applications.
SIAM J. Discret. Math., 2015

On 2-Colorings of Hypergraphs.
J. Graph Theory, 2015

Independent Domination in Cubic Graphs.
J. Graph Theory, 2015

Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey.
J. Comb. Optim., 2015

Total Version of the Domination Game.
Graphs Comb., 2015

Total Dominator Colorings and Total Domination in Graphs.
Graphs Comb., 2015

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs.
Graphs Comb., 2015

Graphs with Large Disjunctive Total Domination Number.
Discret. Math. Theor. Comput. Sci., 2015

Trees with large neighborhood total domination number.
Discret. Appl. Math., 2015

Signed Roman k-domination in trees.
Discret. Appl. Math., 2015

A characterization of the non-trivial diameter two graphs of minimum size.
Discret. Appl. Math., 2015

Domination versus disjunctive domination in trees.
Discret. Appl. Math., 2015

2014
Total Domination in Graphs with Diameter 2.
J. Graph Theory, 2014

Paired versus double domination in K 1, r -free graphs.
J. Comb. Optim., 2014

Signed Roman domination in graphs.
J. Comb. Optim., 2014

Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs.
Graphs Comb., 2014

Simultaneous Domination in Graphs.
Graphs Comb., 2014

Linear hypergraphs with large transversal number and maximum degree two.
Eur. J. Comb., 2014

Induced matchings in subcubic graphs without short cycles.
Discret. Math., 2014

On matching and semitotal domination in graphs.
Discret. Math., 2014

A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem.
Discret. Math., 2014

Relating the annihilation number and the 2-domination number of a tree.
Discret. Math., 2014

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture.
Discret. Appl. Math., 2014

Graphs with maximum size and given paired-domination number.
Discret. Appl. Math., 2014

Independent domination in subcubic bipartite graphs of girth at least six.
Discret. Appl. Math., 2014

An improved lower bound on the independence number of a graph.
Discret. Appl. Math., 2014

A characterization of P<sub>5</sub>-free, diameter-2-critical graphs.
Discret. Appl. Math., 2014

Improved bounds on the domination number of a tree.
Discret. Appl. Math., 2014

A New Lower Bound on the Independence Number of a Graph and Applications.
Electron. J. Comb., 2014

Total Transversals and Total Domination in Uniform Hypergraphs.
Electron. J. Comb., 2014

2013
Generalized Power Domination in Regular Graphs.
SIAM J. Discret. Math., 2013

Edge Weighting Functions on Dominating Sets.
J. Graph Theory, 2013

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three.
J. Graph Theory, 2013

Edge lifting and total domination in graphs.
J. Comb. Optim., 2013

22-colorings in <i>k</i>k-regular <i>k</i>k-uniform hypergraphs.
Eur. J. Comb., 2013

Transversals and matchings in 3-uniform hypergraphs.
Eur. J. Comb., 2013

On graphs with disjoint dominating and 2-dominating sets.
Discuss. Math. Graph Theory, 2013

Domination versus independent domination in cubic graphs.
Discret. Math., 2013

Hypergraphs with large transversal number.
Discret. Math., 2013

Total domination and matching numbers in graphs with all vertices in triangles.
Discret. Math., 2013

Open packing, total domination, and the <i>P</i><sub>3</sub>-Radon number.
Discret. Math., 2013

Independent domination in graphs: A survey and recent results.
Discret. Math., 2013

Bounds on neighborhood total domination in graphs.
Discret. Appl. Math., 2013

Equality in a linear Vizing-like relation that relates the size and total domination number of a graph.
Discret. Appl. Math., 2013

Bounds on the connected domination number of a graph.
Discret. Appl. Math., 2013

Relating the annihilation number and the total domination number of a tree.
Discret. Appl. Math., 2013

2012
Vertex Disjoint Cycles of Different Length in Digraphs.
SIAM J. Discret. Math., 2012

Vizing's conjecture: a survey and recent results.
J. Graph Theory, 2012

k-tuple total domination in cross products of graphs.
J. Comb. Optim., 2012

An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs.
Graphs Comb., 2012

Girth and Total Domination in Graphs.
Graphs Comb., 2012

Transversals and domination in uniform hypergraphs.
Eur. J. Comb., 2012

The maximum diameter of total domination edge-critical graphs.
Discret. Math., 2012

Independent sets and matchings in subcubic graphs.
Discret. Math., 2012

Locating-total domination in claw-free cubic graphs.
Discret. Math., 2012

On a conjecture of Murty and Simon on diameter two critical graphs II.
Discret. Math., 2012

Fair domination in graphs.
Discret. Math., 2012

Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371].
Discret. Math., 2012

Locating-total domination in graphs.
Discret. Appl. Math., 2012

On α-total domination in graphs.
Discret. Appl. Math., 2012

Hypergraphs with large domination number and with edge sizes at least three.
Discret. Appl. Math., 2012

Total domination in inflated graphs.
Discret. Appl. Math., 2012

Multiple factor Nordhaus-Gaddum type results for domination and total domination.
Discret. Appl. Math., 2012

A characterization of diameter-2-critical graphs whose complements are diamond-free.
Discret. Appl. Math., 2012

Directed domination in oriented graphs.
Discret. Appl. Math., 2012

Identifying Vertex Covers in Graphs.
Electron. J. Comb., 2012

2011
A characterization of graphs with disjoint dominating and paired-dominating sets.
J. Comb. Optim., 2011

Which trees have a differentiating-paired dominating set?
J. Comb. Optim., 2011

Upper paired-domination in claw-free graphs.
J. Comb. Optim., 2011

Perfect Matchings in Total Domination Critical Graphs.
Graphs Comb., 2011

Nordhaus-Gaddum Type Results for Total Domination.
Discret. Math. Theor. Comput. Sci., 2011

Dominating sets, packings, and the maximum degree.
Discret. Math., 2011

On a conjecture of Murty and Simon on diameter 2-critical graphs.
Discret. Math., 2011

On the existence of k-partite or K<sub>p</sub>-free total domination edge-critical graphs.
Discret. Math., 2011

Maximal independent sets in minimum colorings.
Discret. Math., 2011

A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free.
Discret. Optim., 2011

A Greedy Partition Lemma for directed domination.
Discret. Optim., 2011

A note on total reinforcement in graphs.
Discret. Appl. Math., 2011

Total domination dot-critical graphs.
Discret. Appl. Math., 2011

Total domination changing and stable graphs upon vertex removal.
Discret. Appl. Math., 2011

An extremal problem for total domination stable graphs upon edge removal.
Discret. Appl. Math., 2011

A New Bound on the Domination Number of Graphs with Minimum Degree Two.
Electron. J. Comb., 2011

Hamiltonicity of <i>k</i>-Traceable Graphs.
Electron. J. Comb., 2011

Nordhaus-Gaddum bounds for total domination.
Appl. Math. Lett., 2011

Bounds on the k-domination number of a graph.
Appl. Math. Lett., 2011

2010
Strong Transversals in Hypergraphs and Double Total Domination in Graphs.
SIAM J. Discret. Math., 2010

A short proof of a result on a Vizing-like problem for integer total domination.
J. Comb. Optim., 2010

Partitioning a graph into a dominating set, a total dominating set, and something else.
Discuss. Math. Graph Theory, 2010

On a conjecture on total domination in claw-free cubic graphs.
Discret. Math., 2010

An upper bound on the paired-domination number in terms of the number of edges in the graph.
Discret. Math., 2010

Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184].
Discret. Math., 2010

Total domination stable graphs upon edge addition.
Discret. Math., 2010

Properties of total domination edge-critical graphs.
Discret. Appl. Math., 2010

Disjoint dominating and total dominating sets in graphs.
Discret. Appl. Math., 2010

k-tuple total domination in graphs.
Discret. Appl. Math., 2010

Total domination critical and stable graphs upon edge removal.
Discret. Appl. Math., 2010

An independent dominating set in the complement of a minimum dominating set of a tree.
Appl. Math. Lett., 2010

2009
Total domination in 2-connected graphs and in graphs with no induced 6-cycles.
J. Graph Theory, 2009

Domination and total domination in complementary prisms.
J. Comb. Optim., 2009

A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order.
Graphs Comb., 2009

Local Steiner convexity.
Eur. J. Comb., 2009

Total domination in planar graphs of diameter two.
Discret. Math., 2009

Remarks about disjoint dominating sets.
Discret. Math., 2009

A survey of selected recent results on total domination in graphs.
Discret. Math., 2009

A survey of stratified domination in graphs.
Discret. Math., 2009

A dedication to Professor Gary Chartrand.
Discret. Math., 2009

An upper bound on the domination number of a graph with minimum degree 2.
Discret. Math., 2009

On the ratios between packing and domination parameters of a graph.
Discret. Math., 2009

Locating and paired-dominating sets in graphs.
Discret. Appl. Math., 2009

On total domination vertex critical graphs of high connectivity.
Discret. Appl. Math., 2009

Domination, radius, and minimum degree.
Discret. Appl. Math., 2009

Bounds relating the weakly connected domination number to the total domination number and the matching number.
Discret. Appl. Math., 2009

Restricted total domination in graphs with minimum degree two.
Ars Comb., 2009

Upper Bounds on the Total Domination Number.
Ars Comb., 2009

2008
Hypergraphs with large transversal number and with edge sizes at least 3.
J. Graph Theory, 2008

Total domination in partitioned trees and partitioned graphs with minimum degree two.
J. Glob. Optim., 2008

On the upper total domination number of Cartesian products of graphs.
J. Comb. Optim., 2008

Total Domination in Graphs with Given Girth.
Graphs Comb., 2008

Total restrained domination in graphs with minimum degree two.
Discret. Math., 2008

On matching and total domination in graphs.
Discret. Math., 2008

The independence number in graphs of maximum degree three.
Discret. Math., 2008

Bounds on total domination in claw-free cubic graphs.
Discret. Math., 2008

Total domination in claw-free graphs with minimum degree 2.
Discret. Math., 2008

A note on graphs with disjoint dominating and total dominating sets.
Ars Comb., 2008

Restrained Domination Excellent Trees.
Ars Comb., 2008

Diameter of paired domination edge-critical graphs.
Australas. J Comb., 2008

2007
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".
J. Graph Theory, 2007

Graphs with large paired-domination number.
J. Comb. Optim., 2007

Restricted domination parameters in graphs.
J. Comb. Optim., 2007

Paired-domination in generalized claw-free graphs.
J. Comb. Optim., 2007

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph.
Graphs Comb., 2007

Domination in partitioned graphs with minimum degree two.
Discret. Math., 2007

On the irregularity of bipartite graphs.
Discret. Math., 2007

Restricted domination in graphs with minimum degree 2.
Discret. Math., 2007

On equality in an upper bound for the restrained and total domination numbers of a graph.
Discret. Math., 2007

A New Upper Bound on the Total Domination Number of a Graph.
Electron. J. Comb., 2007

2006
Trees with Equal Domination and Restrained Domination Numbers.
J. Glob. Optim., 2006

Algorithmic aspects of total k-subdomination in graphs.
Discuss. Math. Graph Theory, 2006

Construction of trees and graphs with equal domination parameters.
Discret. Math., 2006

Simultaneous graph parameters: Factor domination and factor total domination.
Discret. Math., 2006

Locating and total dominating sets in trees.
Discret. Appl. Math., 2006

A note on power domination in grid graphs.
Discret. Appl. Math., 2006

Total Domination and Matching Numbers in Claw-Free Graphs.
Electron. J. Comb., 2006

Stratification and Domination in Prisms.
Ars Comb., 2006

On the signed total chromatic number of a graph.
Ars Comb., 2006

Private Domination Trees.
Ars Comb., 2006

Domination in Planar Graphs with Small Diameter II.
Ars Comb., 2006

Placing monitoring devices in electric power networks modelled by block graphs.
Ars Comb., 2006

Algorithmic aspects of minus total k-subdomination in graphs.
Australas. J Comb., 2006

Total k-subdominating functions on graphs.
Australas. J Comb., 2006

2005
A linear Vizing-like relation relating the size and total domination number of a graph.
J. Graph Theory, 2005

Multiple vertex coverings by cliques.
J. Graph Theory, 2005

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.
J. Comb. Optim., 2005

On the Total Domination Number of Cartesian Products of Graphs.
Graphs Comb., 2005

Paired-domination of Cartesian products of graphs and rainbow domination.
Electron. Notes Discret. Math., 2005

Graphs with double domination numbers.
Discuss. Math. Graph Theory, 2005

On Double Domination in Graphs.
Discuss. Math. Graph Theory, 2005

Stratification and domination in graphs with minimum degree two.
Discret. Math., 2005

Trees with two disjoint minimum independent dominating sets.
Discret. Math., 2005

Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets.
Discret. Math., 2005

Bicritical domination.
Discret. Math., 2005

Trees with Equal Domination and Paired-domination Numbers.
Ars Comb., 2005

2004
Paired-Domination in Claw-Free Cubic Graphs.
Graphs Comb., 2004

Total domination subdivision numbers of graphs.
Discuss. Math. Graph Theory, 2004

On upper domination Ramsey numbers for graphs.
Discret. Math., 2004

Stratification and domination in graphs II.
Discret. Math., 2004

Signed total domination in graphs.
Discret. Math., 2004

Restricted total domination in graphs.
Discret. Math., 2004

Total domination subdivision numbers of trees.
Discret. Math., 2004

The diameter of total domination vertex critical graphs.
Discret. Math., 2004

The average connectivity of a digraph.
Discret. Appl. Math., 2004

Metric-Locating-Dominating Sets in Graphs.
Ars Comb., 2004

Trees with equal average domination and independent domination numbers.
Ars Comb., 2004

Detour Domination in Graphs.
Ars Comb., 2004

A characterization of trees with equal total domination and paired-domination numbers.
Australas. J Comb., 2004

2003
Upper total domination in claw-free graphs.
J. Graph Theory, 2003

Defending the Roman Empire--A new strategy.
Discret. Math., 2003

Total domination excellent trees.
Discret. Math., 2003

Defending the Roman Empire from multiple attacks.
Discret. Math., 2003

Strong equality of domination parameters in trees.
Discret. Math., 2003

<i>H</i>-forming sets in graphs.
Discret. Math., 2003

Changing and unchanging domination: a classification.
Discret. Math., 2003

Nordhaus-Gaddum bounds for independent domination.
Discret. Math., 2003

Vertices contained in all or in no minimum total dominating set of a tree.
Discret. Math., 2003

Stratification and domination in graphs.
Discret. Math., 2003

Graphs of order <i>n</i> with locating-chromatic number <i>n</i>-1.
Discret. Math., 2003

Matching transformation graphs of cubic bipartite plane graphs.
Discret. Math., 2003

Global Defensive Alliances in Graphs.
Electron. J. Comb., 2003

Average lower independence in trees and outerplanar graphs.
Ars Comb., 2003

Graphical Measurement.
Proceedings of the Handbook of Graph Theory., 2003

2002
Domination in Graphs Applied to Electric Power Networks.
SIAM J. Discret. Math., 2002

Domination in planar graphs with small diameter.
J. Graph Theory, 2002

Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas.
Electron. Notes Discret. Math., 2002

A characterization of Roman trees.
Discuss. Math. Graph Theory, 2002

Trees with unique minimum total dominating sets.
Discuss. Math. Graph Theory, 2002

The upper domination Ramsey number <i>u</i>(3, 3, 3).
Discret. Math., 2002

Signed 2-independence in graphs.
Discret. Math., 2002

Restricted domination in graphs.
Discret. Math., 2002

Total domination supercritical graphs with respect to relative complements.
Discret. Math., 2002

Trees with equal domination and tree-free domination numbers.
Discret. Math., 2002

A characterization of <i>i</i>-excellent trees.
Discret. Math., 2002

Total irredundance in graphs.
Discret. Math., 2002

Total domination critical graphs with respect to relative complements.
Ars Comb., 2002

Total domination good vertices in graphs.
Australas. J Comb., 2002

2001
Pancyclicity of the prism.
Discret. Math., 2001

On domination and annihilation in graphs with claw-free blocks.
Discret. Math., 2001

Domination and total domination critical trees with respect to relative complements.
Ars Comb., 2001

Stable and unstable graphs with total irredundance number zero.
Ars Comb., 2001

Multipartite Ramsey Numbers.
Ars Comb., 2001

The average connectivity of regular multipartite tournaments.
Australas. J Comb., 2001

2000
On cliques and bicliques.
J. Graph Theory, 2000

Graphs with large total domination number.
J. Graph Theory, 2000

Characterizations of trees with equal domination parameters.
J. Graph Theory, 2000

Total domination in graphs with minimum degree three.
J. Graph Theory, 2000

Graphs with least domination number three-fifths their order.
Discret. Math., 2000

Bipartite Ramsey numbers and Zarankiewicz numbers.
Discret. Math., 2000

Restrained domination in trees.
Discret. Math., 2000

The domatic numbers of factors of graphs.
Ars Comb., 2000

A characterization of domination 4-relative-critical graphs of diameter 5.
Australas. J Comb., 2000

1999
Generalized eccentricity, radius, and diameter in graphs.
Networks, 1999

Homogeneous Embeddings of Cycles in Graphs.
Graphs Comb., 1999

Graphs with large restrained domination number.
Discret. Math., 1999

Real and integer domination in graphs.
Discret. Math., 1999

On perfect neighborhood sets in graphs.
Discret. Math., 1999

Minus domination in graphs.
Discret. Math., 1999

Queens graphs.
Discret. Math., 1999

On the principal edge bipartition of a graph.
Australas. J Comb., 1999

1998
Strict majority functions on graphs.
J. Graph Theory, 1998

Packing in trees.
Discret. Math., 1998

Star-path bipartite Ramsey numbers<sup>, </sup>.
Discret. Math., 1998

Some General Aspects of the Framing Number of a Digraph.
Discret. Appl. Math., 1998

Partial signed domination in graphs.
Ars Comb., 1998

Distance irredundance in graphs: complexity issues.
Ars Comb., 1998

Closed neighborhood order dominating functions.
Australas. J Comb., 1998

Domination critical graphs with respect to relative complements.
Australas. J Comb., 1998

1997
A note on cliques and independent sets.
J. Graph Theory, 1997

Opinion functions on trees.
Discret. Math., 1997

Switching Distance Graphs.
Ars Comb., 1997

Edge homogeneous embeddings of cycles in graphs.
Australas. J Comb., 1997

1996
Inequalities relating domination parameters in cubic graphs.
Discret. Math., 1996

Local edge domination critical graphs.
Discret. Math., 1996

The diversity of domination.
Discret. Math., 1996

Minus domination in regular graphs.
Discret. Math., 1996

An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discret. Appl. Math., 1996

The Algorithmic Complexity of Minus Domination in Graphs.
Discret. Appl. Math., 1996

Domination in regular graphs.
Ars Comb., 1996

1995
Irredundance perfect graphs.
Discret. Math., 1995

Majority domination in graphs.
Discret. Math., 1995

Distance independence domination in graphs.
Ars Comb., 1995

The algorithmic complexity of signed domination in graphs.
Australas. J Comb., 1995

1994
Extremal results on defective colorings of graphs.
Discret. Math., 1994

Three-valued k-neighborhood domination in graphs.
Australas. J Comb., 1994

On the integrity of distance domination in graphs.
Australas. J Comb., 1994

1993
Principal Common Divisors of Graphs.
Eur. J. Comb., 1993

Bounds relating generalized domination parameters.
Discret. Math., 1993

On the computational complexity of upper distance fractional domination.
Australas. J Comb., 1993

1992
Some nordhaus- gaddum-type results.
J. Graph Theory, 1992


  Loading...