Michael A. Henning

,

Shahin N. Jogan

Graphs Comb., February, 2026

Fault-tolerant resolving power domination of fractal cubic network.

[BibT_eX]

[DOI]

,

,

,

J. Parallel Distributed Comput., 2026

New probabilistic upper bounds on the domination number of a graph: II.

[BibT_eX]

[DOI]

,

Discret. Math., 2026

Connected domination versus dominating sets inducing large components.

[BibT_eX]

[DOI]

,

Discret. Math., 2026

Secure domination in P5-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2026

Identifying codes in graphs of given maximum degree: Characterizing trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2026

Paired domination in graphs with minimum degree four.

[BibT_eX]

[DOI]

,

Discret. Math., 2026

Disjunctive domination in maximal outerplanar graphs.

[BibT_eX]

[DOI]

,

Paras Maniya

,

Discret. Appl. Math., 2026

Reducing regular graphs to partition their vertices into a total dominating set and an independent dominating set.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2026

Edge general position in graphs: Graph products, integer linear programming and some applications.

[BibT_eX]

[DOI]

Zahra Hamed-Labbafian

,

,

Discret. Appl. Math., 2026

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree.

[BibT_eX]

[DOI]

Dipayan Chakraborty

,

,

Hossein Abdollahzadeh Ahangar

Discret. Appl. Math., 2026

A Note on Partitioning the Vertex Set of a Graph into a Dominating Set and a Locating Dominating Set.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2026

New upper bounds on Zagreb indices with given domination number.

[BibT_eX]

[DOI]

Hadi Rahbani

,

,

Appl. Math. Comput., 2026

2-Domination edge subdivision in trees.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., October, 2025

Double Coalitions in Regular Graphs.

[BibT_eX]

[DOI]

,

Doost Ali Mojdeh

Graphs Comb., August, 2025

Secure domination in P5-free graphs.

[BibT_eX]

[DOI]

,

,

,

CoRR, March, 2025

Paired versus double domination in forbidden graph classes.

[BibT_eX]

[DOI]

,

Paras Maniya

,

Comput. Appl. Math., February, 2025

Extensions and applications of the Tuza-Vestergaard theorem.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2025

On total domination subdivision numbers of trees.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2025

3-neighbor bootstrap percolation on grids.

[BibT_eX]

[DOI]

Jaka Hedzet

,

Discuss. Math. Graph Theory, 2025

Recognizable coloring of graphs.

[BibT_eX]

[DOI]

Zahra Hamed-Labbafian

,

,

,

Narjes Sabeghi

Discuss. Math. Graph Theory, 2025

Characterization of α-excellent 2-trees.

[BibT_eX]

[DOI]

Magda Dettlaff

,

,

Discuss. Math. Graph Theory, 2025

Complementary coalition graphs: characterization and algorithm.

[BibT_eX]

[DOI]

Davood Bakhshesh

,

Discuss. Math. Graph Theory, 2025

End super dominating sets in graphs.

[BibT_eX]

[DOI]

Saieed Akbari

,

Nima Ghanbari

,

Discuss. Math. Graph Theory, 2025

Transversal coalitions in hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2025

On the domination number of graphs with minimum degree at least seven.

[BibT_eX]

[DOI]

,

Discret. Math., 2025

More on the complexity of defensive domination in graphs.

[BibT_eX]

[DOI]

,

,

Vikash Tripathi

Discret. Appl. Math., 2025

Paired-domination in binary trees.

[BibT_eX]

[DOI]

Aaron D. Gray

,

Discret. Appl. Math., 2025

Indicated total domination game.

[BibT_eX]

[DOI]

,

Hossein Abdollahzadeh Ahangar

Ars Math. Contemp., 2025

k-Domination ivariants on Kneser graphs.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2025

New bounds on Zagreb connection indices for trees with fixed domination number.

[BibT_eX]

[DOI]

Hadi Rahbani

,

,

AKCE Int. J. Graphs Comb., 2025

Local edge metric dimensions via corona products and integer linear programming.

[BibT_eX]

[DOI]

Fateme Amini

,

,

Comput. Appl. Math., September, 2024

Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set.

[BibT_eX]

[DOI]

,

Australas. J Comb., June, 2024

Transversals in regular uniform hypergraphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, March, 2024

Singleton coalition graph chains.

[BibT_eX]

[DOI]

Davood Bakhshesh

,

,

Comput. Appl. Math., March, 2024

On the cycle-path bipartite Ramsey number.

[BibT_eX]

[DOI]

,

Discret. Math., February, 2024

Algorithms and hardness results for edge total domination problem in graphs.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., January, 2024

Partial domination in supercubic graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., January, 2024

Common domination perfect graphs.

[BibT_eX]

[DOI]

Magda Dettlaff

,

,

Discret. Appl. Math., January, 2024

Optimal linear-Vizing relationships for (total) domination in graphs.

[BibT_eX]

[DOI]

,

Paul Horn

J. Graph Theory, 2024

Best possible upper bounds on the restrained domination number of cubic graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2024

Minimal graphs with disjoint dominating and total dominating sets.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2024

Progress towards the two-thirds conjecture on locating-total dominating sets.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2024

Mostar index and bounded maximum degree.

[BibT_eX]

[DOI]

,

,

,

Discret. Optim., 2024

The packing number of cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Optim., 2024

A characterization of graphs with given total coalition numbers.

[BibT_eX]

[DOI]

,

Shahin N. Jogan

Discret. Appl. Math., 2024

A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2024

The 1/3-conjectures for domination in cubic graphs.

[BibT_eX]

[DOI]

,

Michael Anthony Henning

CoRR, 2024

The Sierpiński domination number.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2024

Domination parameters and the removal of matchings.

[BibT_eX]

[DOI]

Geoffrey Boyer

,

,

Appl. Math. Comput., 2024

Complexity of Total Dominator Coloring in Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., December, 2023

Graphs with Unique Minimum Specified Domination Sets.

[BibT_eX]

[DOI]

,

Graphs Comb., October, 2023

Paired-domination game played on cycles.

[BibT_eX]

[DOI]

Aaron D. Gray

,

Discret. Appl. Math., September, 2023

The Tuza-Vestergaard Theorem.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., June, 2023

Algorithmic aspects of paired disjunctive domination in graphs.

[BibT_eX]

[DOI]

,

,

Vikash Tripathi

Theor. Comput. Sci., 2023

On a Conjecture About the Local Metric Dimension of Graphs.

[BibT_eX]

[DOI]

Ali Ghalavand

,

,

Graphs Comb., 2023

Hop domination in chordal bipartite graphs.

[BibT_eX]

[DOI]

,

Saikat Pal

,

Discuss. Math. Graph Theory, 2023

Unique minimum semipaired dominating sets in trees.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2023

Total and paired domination stability in prisms.

[BibT_eX]

[DOI]

Aleksandra Gorzkowska

,

,

,

Elzbieta Tumidajewicz

Discuss. Math. Graph Theory, 2023

Zero and total forcing dense graphs.

[BibT_eX]

[DOI]

,

,

Ryan Pepper

Discuss. Math. Graph Theory, 2023

A generalization of Petersen's matching theorem.

[BibT_eX]

[DOI]

,

Discret. Math., 2023

Independent domination in outerplanar graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2023

The minmin coalition number in graphs.

[BibT_eX]

[DOI]

Davood Bakhshesh

,

CoRR, 2023

A complete description of convex sets associated with matchings and edge-connectivity in graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2022

Independent domination in subcubic graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Optim., 2022

Paired Domination in Trees.

[BibT_eX]

[DOI]

Aleksandra Gorzkowska

,

,

Elzbieta Kleszcz

,

Graphs Comb., 2022

Upper Total Domination in Claw-Free Cubic Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2022

Triangles and (Total) Domination in Subcubic Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2022

Improved Bounds on the k-tuple (Roman) Domination Number of a Graph.

[BibT_eX]

[DOI]

Noor A'lawiah Abd Aziz

,

,

,

Hailiza Kamarulhaili

Graphs Comb., 2022

An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six.

[BibT_eX]

[DOI]

,

Graphs Comb., 2022

The semitotal domination problem in block graphs.

[BibT_eX]

[DOI]

,

Saikat Pal

,

Discuss. Math. Graph Theory, 2022

Bounds on domination parameters in graphs: a brief survey.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

A classification of cactus graphs according to their domination number.

[BibT_eX]

[DOI]

Majid Hajian

,

,

Discuss. Math. Graph Theory, 2022

A characterization of graphs with given maximum degree and smallest possible matching number: II.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

Domination versus total domination in claw-free cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

Local metric dimension for graphs with small clique numbers.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2022

Domination and dominator colorings in planar graphs with small diameter.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2022

Paired domination stability in graphs.

[BibT_eX]

[DOI]

Aleksandra Gorzkowska

,

,

,

Elzbieta Tumidajewicz

Ars Math. Contemp., 2022

Bounds on the paired domination number of graphs with minimum degree at least three.

[BibT_eX]

[DOI]

,

,

Elzbieta Tumidajewicz

Appl. Math. Comput., 2022

Compelling colorings: A generalization of the dominator chromatic number.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2022

Graphs with disjoint $2$-dominating sets.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2022

A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2021

Bounds on the semipaired domination number of graphs with minimum degree at least two.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2021

Zero forcing versus domination in cubic graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2021

Affine Planes and Transversals in 3-Uniform Linear Hypergraphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2021

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2021

Independent Domination Subdivision in Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2021

Semipaired Domination in Some Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

,

,

Vikash Tripathi

Discret. Math. Theor. Comput. Sci., 2021

Minimal graphs with disjoint dominating and paired-dominating sets.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2021

Restrained domination in self-complementary graphs.

[BibT_eX]

[DOI]

,

,

Discuss. Math. Graph Theory, 2021

A new framework to approach Vizing's conjecture.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2021

Matching and edge-connectivity in graphs with given maximum degree.

[BibT_eX]

[DOI]

,

Discret. Math., 2021

A characterization of graphs with given maximum degree and smallest possible matching number.

[BibT_eX]

[DOI]

,

Discret. Math., 2021

On (1, 2)-domination in cubic graphs.

[BibT_eX]

[DOI]

Mohammadhossein Fakharan

,

,

,

,

Discret. Math., 2021

On the domination number of graphs with minimum degree six.

[BibT_eX]

[DOI]

,

Discret. Math., 2021

Bounding and approximating minimum maximal matchings in regular graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2021

Lower bounds on Tuza constants for transversals in linear uniform hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2021

A new upper bound on the total domination number in graphs with minimum degree six.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2021

The enclaveless competition game.

[BibT_eX]

[DOI]

,

Ars Math. Contemp., 2021

Connected domination critical graphs with a block having maximum number of cut vertices.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2021

Perfect Italian domination in cographs.

[BibT_eX]

[DOI]

Sumanta Banerjee

,

,

Appl. Math. Comput., 2021

Algorithmic aspects of upper paired-domination in graphs.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2020

Bounds on upper transversals in hypergraphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2020

Algorithmic results on double Roman domination in graphs.

[BibT_eX]

[DOI]

Sumanta Banerjee

,

,

J. Comb. Optim., 2020

Algorithm and hardness results on hop domination in graphs.

[BibT_eX]

[DOI]

,

Saikat Pal

,

Inf. Process. Lett., 2020

Trees with Unique Minimum Semitotal Dominating Sets.

[BibT_eX]

[DOI]

,

Graphs Comb., 2020

Equating k maximum degrees in graphs without short cycles.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2020

Total forcing sets and zero forcing sets in trees.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2020

Domination versus independent domination in graphs of small regularity.

[BibT_eX]

[DOI]

,

Discret. Math., 2020

2-limited broadcast domination in subcubic graphs.

[BibT_eX]

[DOI]

,

,

Frank Yang

Discret. Appl. Math., 2020

Maker-Breaker total domination game.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2020

A 34-approximation of Vizing's conjecture for claw-free graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2020

Total domination cover rubbling.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2020

Domination versus edge domination.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2020

Traceability of connected domination critical graphs.

[BibT_eX]

[DOI]

,

Nawarat Ananchuen

,

Appl. Math. Comput., 2020

Independent domination, colorings and the fractional idomatic number of a graph.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2020

Algorithmic aspects of semitotal domination in graphs.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2019

Semipaired domination in maximal outerplanar graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2019

A new lower bound on the domination number of a graph.

[BibT_eX]

[DOI]

Majid Hajian

,

,

J. Comb. Optim., 2019

Independent Domination in Bipartite Cubic Graphs.

[BibT_eX]

[DOI]

Christoph Brause

,

Graphs Comb., 2019

Upper transversals in hypergraphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2019

On the maximum number of minimum total dominating sets in forests.

[BibT_eX]

[DOI]

,

Elena Mohr

,

Discret. Math. Theor. Comput. Sci., 2019

Graphs with large semipared domination number.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2019

On accurate domination in graphs.

[BibT_eX]

[DOI]

Joanna Cyman

,

,

Discuss. Math. Graph Theory, 2019

On independent domination in planar, cubic graphs.

[BibT_eX]

[DOI]

,

,

Freydoon Rahbarnia

Discuss. Math. Graph Theory, 2019

A note on improved upper bounds on the transversal number of hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2019

Cutting lemma and union lemma for the domination game.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2019

A characterization of double Roman trees.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2019

Perfect Italian domination in trees.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2019

Uniquely restricted matchings in subcubic graphs.

[BibT_eX]

[DOI]

Maximilian Fürst

,

,

Discret. Appl. Math., 2019

On the total forcing number of a graph.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2019

A characterization of graphs with disjoint total dominating sets.

[BibT_eX]

[DOI]

,

Iztok Peterin

Ars Math. Contemp., 2019

Total forcing versus total domination in cubic graphs.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2019

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.

[BibT_eX]

[DOI]

,

,

,

,

,

SIAM J. Discret. Math., 2018

Tight lower bounds on the matching number in a graph with given maximum degree.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2018

Thoroughly dispersed colorings.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2018

Smallest domination number and largest independence number of graphs and forests with given degree sequence.

[BibT_eX]

[DOI]

Michael Gentner

,

,

J. Graph Theory, 2018

Perfect graphs involving semitotal and semipaired domination.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2018

A note on domination and total domination in prisms.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2018

Semipaired Domination in Claw-Free Cubic Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2018

Bounds on the Connected Forcing Number of a Graph.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2018

Total Forcing and Zero Forcing in Claw-Free Cubic Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2018

Total Domination Versus Domination in Cubic Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2018

Hereditary equality of domination and exponential domination.

[BibT_eX]

[DOI]

,

Simon Jäger

,

Discuss. Math. Graph Theory, 2018

Domination parameters of a graph and its complement.

[BibT_eX]

[DOI]

,

,

Discuss. Math. Graph Theory, 2018

Total domination in versus paired-domination in regular graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2018

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2018

Independent domination in subcubic graphs of girth at least six.

[BibT_eX]

[DOI]

,

Discret. Math., 2018

k-broadcast domination and k-multipacking.

[BibT_eX]

[DOI]

,

,

Frank Yang

Discret. Appl. Math., 2018

Game total domination critical graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2018

Perfect Roman domination in trees.

[BibT_eX]

[DOI]

,

William F. Klostermeyer

,

Discret. Appl. Math., 2018

Total domination stability in graphs.

[BibT_eX]

[DOI]

,

Marcin Krzywkowski

Discret. Appl. Math., 2018

Essential upper bounds on the total domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

The matcher game played in graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2018

On upper bounds for the independent transversal domination number.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2018

On Upper Transversals in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2018

A New Lower Bound on the Total Domination Number of a Tree.

[BibT_eX]

,

Ars Comb., 2018

Distance domination in graphs with given minimum and maximum degree.

[BibT_eX]

[DOI]

,

Nicolas Lichiardopol

J. Comb. Optim., 2017

The game total domination problem is log-complete in PSPACE.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2017

On 2-Step and Hop Dominating Sets in Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2017

Edge Weighting Functions on Semitotal Dominating Sets.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Bounds on the game transversal number in hypergraphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2017

A characterization of trees with equal 2-domination and 2-independence numbers.

[BibT_eX]

[DOI]

Christoph Brause

,

,

Marcin Krzywkowski

Discret. Math. Theor. Comput. Sci., 2017

Domination game: extremal families for 3/5-conjecture for forests.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2017

A note on fractional disjoint transversals in hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

Matchings, path covers and domination.

[BibT_eX]

[DOI]

,

Kirsti Wash

Discret. Math., 2017

Location-domination in line graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

Relating domination, exponential domination, and porous exponential domination.

[BibT_eX]

[DOI]

,

Simon Jäger

,

Discret. Optim., 2017

Trees with equal total domination and game total domination numbers.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2017

Italian domination in trees.

[BibT_eX]

[DOI]

,

William F. Klostermeyer

Discret. Appl. Math., 2017

Partitioning the vertices of a cubic graph into two total dominating sets.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2017

Transversals and Independence in Linear Hypergraphs with Maximum Degree Two.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2017

(Total) Domination in Prisms.

[BibT_eX]

[DOI]

Jernej Azarija

,

,

Electron. J. Comb., 2017

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

[BibT_eX]

[DOI]

,

,

Comb., 2017

Bounds for the $m$-Eternal Domination Number of a Graph.

[BibT_eX]

[DOI]

,

William Klostermeyer

,

Contributions Discret. Math., 2017

Lower Bounds on the Distance Domination Number of a Graph.

[BibT_eX]

[DOI]

,

,

,

Contributions Discret. Math., 2017

Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two.

[BibT_eX]

[DOI]

,

William B. Kinnersley

SIAM J. Discret. Math., 2016

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2016

The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2016

Disjunctive total domination in graphs.

[BibT_eX]

[DOI]

,

Viroshan Naicker

J. Comb. Optim., 2016

Lower bounds on the total domination number of a graph.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2016

Signed Roman k-Domination in Graphs.

[BibT_eX]

[DOI]

,

Lutz Volkmann

Graphs Comb., 2016

Induced Cycles in Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2016

Bounds on the disjunctive total domination number of a tree.

[BibT_eX]

[DOI]

,

Viroshan Naicker

Discuss. Math. Graph Theory, 2016

Vertices contained in all or in no minimum semitotal dominating set of a tree.

[BibT_eX]

[DOI]

,

Alister J. Marcon

Discuss. Math. Graph Theory, 2016

A characterization of hypergraphs with large domination number.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2016

A note on non-dominating set partitions in graphs.

[BibT_eX]

[DOI]

,

,

Discuss. Math. Graph Theory, 2016

Progress towards the total domination game -conjecture.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

Location-domination and matching in cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

Independence in 5-uniform hypergraphs.

[BibT_eX]

[DOI]

Alex Eustis

,

,

Discret. Math., 2016

Total dominating sequences in graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2016

Trees with large m-eternal domination number.

[BibT_eX]

[DOI]

,

William F. Klostermeyer

Discret. Appl. Math., 2016

Induced 2-regular subgraphs in k-chordal cubic graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

Largest domination number and smallest independence number of forests with given degree sequence.

[BibT_eX]

[DOI]

Michael Gentner

,

,

Discret. Appl. Math., 2016

Locating-dominating sets in twin-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

Game total domination for cycles and paths.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2016

Transversals in 4-Uniform Hypergraphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2016

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2016

Total Transversals in Hypergraphs and Their Applications.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2015

On 2-Colorings of Hypergraphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2015

Independent Domination in Cubic Graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2015

Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2015

Total Version of the Domination Game.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2015

Total Dominator Colorings and Total Domination in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

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

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2015

Graphs with Large Disjunctive Total Domination Number.

[BibT_eX]

[DOI]

Michael Anthony Henning

,

Viroshan Naicker

Discret. Math. Theor. Comput. Sci., 2015

Trees with large neighborhood total domination number.

[BibT_eX]

[DOI]

,

Kirsti Wash

Discret. Appl. Math., 2015

Signed Roman k-domination in trees.

[BibT_eX]

[DOI]

,

Lutz Volkmann

Discret. Appl. Math., 2015

A characterization of the non-trivial diameter two graphs of minimum size.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2015

Domination versus disjunctive domination in trees.

[BibT_eX]

[DOI]

,

Sinclair A. Marcon

Discret. Appl. Math., 2015

Total Domination in Graphs with Diameter 2.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2014

Paired versus double domination in K 1, r -free graphs.

[BibT_eX]

[DOI]

,

Bert L. Hartnell

,

Hossein Abdollahzadeh Ahangar

J. Comb. Optim., 2014

Signed Roman domination in graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Optim., 2014

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2014

Simultaneous Domination in Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2014

Linear hypergraphs with large transversal number and maximum degree two.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2014

Induced matchings in subcubic graphs without short cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2014

On matching and semitotal domination in graphs.

[BibT_eX]

[DOI]

,

Alister J. Marcon

Discret. Math., 2014

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

[BibT_eX]

[DOI]

,

Discret. Math., 2014

Relating the annihilation number and the 2-domination number of a tree.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2014

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2014

Graphs with maximum size and given paired-domination number.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2014

Independent domination in subcubic bipartite graphs of girth at least six.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2014

An improved lower bound on the independence number of a graph.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2014

A characterization of P5-free, diameter-2-critical graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2014

Improved bounds on the domination number of a tree.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2014

A New Lower Bound on the Independence Number of a Graph and Applications.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2014

Total Transversals and Total Domination in Uniform Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2014

Generalized Power Domination in Regular Graphs.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2013

Edge Weighting Functions on Dominating Sets.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2013

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2013

Edge lifting and total domination in graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2013

2-colorings in k-regular k-uniform hypergraphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2013

Transversals and matchings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2013

On graphs with disjoint dominating and 2-dominating sets.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2013

Domination versus independent domination in cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Hypergraphs with large transversal number.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Total domination and matching numbers in graphs with all vertices in triangles.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Open packing, total domination, and the P3-Radon number.

[BibT_eX]

[DOI]

,

,

Philipp Matthias Schäfer

Discret. Math., 2013

Independent domination in graphs: A survey and recent results.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Bounds on neighborhood total domination in graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

Equality in a linear Vizing-like relation that relates the size and total domination number of a graph.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

Bounds on the connected domination number of a graph.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2013

Relating the annihilation number and the total domination number of a tree.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2013

Vertex Disjoint Cycles of Different Length in Digraphs.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2012

Vizing's conjecture: a survey and recent results.

[BibT_eX]

[DOI]

,

,

,

,

,

,

J. Graph Theory, 2012

k-tuple total domination in cross products of graphs.

[BibT_eX]

[DOI]

,

Adel P. Kazemi

J. Comb. Optim., 2012

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2012

Girth and Total Domination in Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2012

Transversals and domination in uniform hypergraphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2012

The maximum diameter of total domination edge-critical graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Independent sets and matchings in subcubic graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

Locating-total domination in claw-free cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

On a conjecture of Murty and Simon on diameter two critical graphs II.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

Fair domination in graphs.

[BibT_eX]

[DOI]

,

Adriana Hansberg

,

Discret. Math., 2012

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

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2012

Locating-total domination in graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

On α-total domination in graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

Hypergraphs with large domination number and with edge sizes at least three.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

Total domination in inflated graphs.

[BibT_eX]

[DOI]

,

Adel P. Kazemi

Discret. Appl. Math., 2012

Multiple factor Nordhaus-Gaddum type results for domination and total domination.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2012

A characterization of diameter-2-critical graphs whose complements are diamond-free.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

Directed domination in oriented graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

Identifying Vertex Covers in Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2012

A characterization of graphs with disjoint dominating and paired-dominating sets.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2011

Which trees have a differentiating-paired dominating set?

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2011

Upper paired-domination in claw-free graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2011

Perfect Matchings in Total Domination Critical Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2011

Nordhaus-Gaddum Type Results for Total Domination.

[BibT_eX]

[DOI]

,

,

Discret. Math. Theor. Comput. Sci., 2011

Dominating sets, packings, and the maximum degree.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2011

On a conjecture of Murty and Simon on diameter 2-critical graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2011

On the existence of k-partite or Kp-free total domination edge-critical graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2011

Maximal independent sets in minimum colorings.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2011

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

[BibT_eX]

[DOI]

,

,

Discret. Optim., 2011

A Greedy Partition Lemma for directed domination.

[BibT_eX]

[DOI]

,

Discret. Optim., 2011

A note on total reinforcement in graphs.

[BibT_eX]

[DOI]

,

,

Joanna Raczek

Discret. Appl. Math., 2011

Total domination dot-critical graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2011

Total domination changing and stable graphs upon vertex removal.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2011

An extremal problem for total domination stable graphs upon edge removal.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2011

A New Bound on the Domination Number of Graphs with Minimum Degree Two.

[BibT_eX]

[DOI]

,

Ingo Schiermeyer

,

Electron. J. Comb., 2011

Hamiltonicity of k-Traceable Graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Electron. J. Comb., 2011

Nordhaus-Gaddum bounds for total domination.

[BibT_eX]

[DOI]

,

,

Appl. Math. Lett., 2011

Bounds on the k-domination number of a graph.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Lett., 2011

Strong Transversals in Hypergraphs and Double Total Domination in Graphs.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2010

A short proof of a result on a Vizing-like problem for integer total domination.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

Partitioning a graph into a dominating set, a total dominating set, and something else.

[BibT_eX]

[DOI]

,

,

Discuss. Math. Graph Theory, 2010

On a conjecture on total domination in claw-free cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

An upper bound on the paired-domination number in terms of the number of edges in the graph.

[BibT_eX]

[DOI]

Discret. Math., 2010

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

[BibT_eX]

[DOI]

Discret. Math., 2010

Total domination stable graphs upon edge addition.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2010

Properties of total domination edge-critical graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2010

Disjoint dominating and total dominating sets in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2010

k-tuple total domination in graphs.

[BibT_eX]

[DOI]

,

Adel P. Kazemi

Discret. Appl. Math., 2010

Total domination critical and stable graphs upon edge removal.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2010

An independent dominating set in the complement of a minimum dominating set of a tree.

[BibT_eX]

[DOI]

,

,

Appl. Math. Lett., 2010

Total domination in 2-connected graphs and in graphs with no induced 6-cycles.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2009

Domination and total domination in complementary prisms.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2009

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2009

Local Steiner convexity.

[BibT_eX]

[DOI]

,

Morten Hegner Nielsen

,

Eur. J. Comb., 2009

Total domination in planar graphs of diameter two.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

Remarks about disjoint dominating sets.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

A survey of selected recent results on total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

A survey of stratified domination in graphs.

[BibT_eX]

[DOI]

,

,

Ping Zhang

Discret. Math., 2009

A dedication to Professor Gary Chartrand.

[BibT_eX]

[DOI]

,

,

Ping Zhang

Discret. Math., 2009

An upper bound on the domination number of a graph with minimum degree 2.

[BibT_eX]

[DOI]

Allan Frendrup

,

,

Bert Randerath

,

Preben D. Vestergaard

Discret. Math., 2009

On the ratios between packing and domination parameters of a graph.

[BibT_eX]

[DOI]

Alewyn P. Burger

,

,

Jan H. van Vuuren

Discret. Math., 2009

Locating and paired-dominating sets in graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

On total domination vertex critical graphs of high connectivity.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

Domination, radius, and minimum degree.

[BibT_eX]

[DOI]

,

Simon Mukwembi

Discret. Appl. Math., 2009

Bounds relating the weakly connected domination number to the total domination number and the matching number.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

Restricted total domination in graphs with minimum degree two.

[BibT_eX]

Ars Comb., 2009

Upper Bounds on the Total Domination Number.

[BibT_eX]

,

Ars Comb., 2009

Hypergraphs with large transversal number and with edge sizes at least 3.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2008

Total domination in partitioned trees and partitioned graphs with minimum degree two.

[BibT_eX]

[DOI]

Allan Frendrup

,

,

Preben D. Vestergaard

J. Glob. Optim., 2008

On the upper total domination number of Cartesian products of graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2008

Total Domination in Graphs with Given Girth.

[BibT_eX]

[DOI]

,

Graphs Comb., 2008

Total restrained domination in graphs with minimum degree two.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

On matching and total domination in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

The independence number in graphs of maximum degree three.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Bounds on total domination in claw-free cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Total domination in claw-free graphs with minimum degree 2.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

A note on graphs with disjoint dominating and total dominating sets.

[BibT_eX]

,

Ars Comb., 2008

Restrained Domination Excellent Trees.

[BibT_eX]

,

Ars Comb., 2008

Diameter of paired domination edge-critical graphs.

[BibT_eX]

[DOI]

Michelle Edwards

,

Richard G. Gibson

,

,

Australas. J Comb., 2008

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

[BibT_eX]

[DOI]

Erfang Shan

,

Liying Kang

,

J. Graph Theory, 2007

Graphs with large paired-domination number.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Restricted domination parameters in graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2007

Paired-domination in generalized claw-free graphs.

[BibT_eX]

[DOI]

,

Sylvain Gravier

,

J. Comb. Optim., 2007

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph.

[BibT_eX]

[DOI]

,

Graphs Comb., 2007

Domination in partitioned graphs with minimum degree two.

[BibT_eX]

[DOI]

,

Preben D. Vestergaard

Discret. Math., 2007

On the irregularity of bipartite graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

Restricted domination in graphs with minimum degree 2.

[BibT_eX]

[DOI]

Discret. Math., 2007

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

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2007

A New Upper Bound on the Total Domination Number of a Graph.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2007

Trees with Equal Domination and Restrained Domination Numbers.

[BibT_eX]

[DOI]

,

,

,

J. Glob. Optim., 2006

Algorithmic aspects of total k-subdomination in graphs.

[BibT_eX]

[DOI]

Laura M. Harris

,

,

Discuss. Math. Graph Theory, 2006

Construction of trees and graphs with equal domination parameters.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2006

Simultaneous graph parameters: Factor domination and factor total domination.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2006

Locating and total dominating sets in trees.

[BibT_eX]

[DOI]

,

,

Jamie Howard

Discret. Appl. Math., 2006

A note on power domination in grid graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2006

Total Domination and Matching Numbers in Claw-Free Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2006

Stratification and Domination in Prisms.

[BibT_eX]

,

Ars Comb., 2006

On the signed total chromatic number of a graph.

[BibT_eX]

Ars Comb., 2006

Private Domination Trees.

[BibT_eX]

,

Ars Comb., 2006

Domination in Planar Graphs with Small Diameter II.

[BibT_eX]

,

,

Ars Comb., 2006

Placing monitoring devices in electric power networks modelled by block graphs.

[BibT_eX]

David Atkins

,

,

Ars Comb., 2006

Algorithmic aspects of minus total k-subdomination in graphs.

[BibT_eX]

[DOI]

Laura M. Harris

,

,

Australas. J Comb., 2006

Total k-subdominating functions on graphs.

[BibT_eX]

[DOI]

Laura M. Harris

,

,

Australas. J Comb., 2006

A linear Vizing-like relation relating the size and total domination number of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Multiple vertex coverings by cliques.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2005

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.

[BibT_eX]

[DOI]

,

Michael D. Plummer

J. Comb. Optim., 2005

On the Total Domination Number of Cartesian Products of Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2005

Paired-domination of Cartesian products of graphs and rainbow domination.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2005

Graphs with double domination numbers.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

On Double Domination in Graphs.

[BibT_eX]

[DOI]

Jochen Harant

,

Discuss. Math. Graph Theory, 2005

Stratification and domination in graphs with minimum degree two.

[BibT_eX]

[DOI]

,

Discret. Math., 2005

Trees with two disjoint minimum independent dominating sets.

[BibT_eX]

[DOI]

,

Discret. Math., 2005

Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2005

Bicritical domination.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2005

Trees with Equal Domination and Paired-domination Numbers.

[BibT_eX]

,

,

Ars Comb., 2005

Paired-Domination in Claw-Free Cubic Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2004

Total domination subdivision numbers of graphs.

[BibT_eX]

[DOI]

,

,

Lora Hopkins

Discuss. Math. Graph Theory, 2004

On upper domination Ramsey numbers for graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Stratification and domination in graphs II.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Signed total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Restricted total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Total domination subdivision numbers of trees.

[BibT_eX]

[DOI]

,

,

Lora Hopkins

Discret. Math., 2004

The diameter of total domination vertex critical graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

The average connectivity of a digraph.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2004

Metric-Locating-Dominating Sets in Graphs.

[BibT_eX]

,

Ars Comb., 2004

Trees with equal average domination and independent domination numbers.

[BibT_eX]

Ars Comb., 2004

Detour Domination in Graphs.

[BibT_eX]

,

,

,

Ars Comb., 2004

A characterization of trees with equal total domination and paired-domination numbers.

[BibT_eX]

[DOI]

Erfang Shan

,

Liying Kang

,

Australas. J Comb., 2004

Upper total domination in claw-free graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2003

Defending the Roman Empire--A new strategy.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

Total domination excellent trees.

[BibT_eX]

[DOI]

Discret. Math., 2003

Defending the Roman Empire from multiple attacks.

[BibT_eX]

[DOI]

Discret. Math., 2003

Strong equality of domination parameters in trees.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2003

H-forming sets in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2003

Changing and unchanging domination: a classification.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

Nordhaus-Gaddum bounds for independent domination.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

Vertices contained in all or in no minimum total dominating set of a tree.

[BibT_eX]

[DOI]

Ernest J. Cockayne

,

,

Discret. Math., 2003

Stratification and domination in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2003

Graphs of order n with locating-chromatic number n-1.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2003

Matching transformation graphs of cubic bipartite plane graphs.

[BibT_eX]

[DOI]

Sheng Bau

,

Discret. Math., 2003

Global Defensive Alliances in Graphs.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2003

Average lower independence in trees and outerplanar graphs.

[BibT_eX]

Sheng Bau

,

,

Peter Dankelmann

Ars Comb., 2003

Domination in Graphs Applied to Electric Power Networks.

[BibT_eX]

[DOI]

Sandra Mitchell Hedetniemi

,

,

,

SIAM J. Discret. Math., 2002

Domination in planar graphs with small diameter.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2002

A characterization of Roman trees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2002

Trees with unique minimum total dominating sets.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2002

The upper domination Ramsey number u(3, 3, 3).

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Signed 2-independence in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Restricted domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Total domination supercritical graphs with respect to relative complements.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2002

Trees with equal domination and tree-free domination numbers.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

A characterization of i-excellent trees.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Total irredundance in graphs.

[BibT_eX]

[DOI]

,

,

,

,

Debra J. Knisley

Discret. Math., 2002

Total domination critical graphs with respect to relative complements.

[BibT_eX]

,

,

Ars Comb., 2002

Total domination good vertices in graphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2002

Pancyclicity of the prism.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

On domination and annihilation in graphs with claw-free blocks.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2001

Domination and total domination critical trees with respect to relative complements.

[BibT_eX]

,

,

Ars Comb., 2001

Stable and unstable graphs with total irredundance number zero.

[BibT_eX]

,

,

,

Debra J. Knisley

Ars Comb., 2001

Multipartite Ramsey Numbers.

[BibT_eX]

,

,

,

Ars Comb., 2001

The average connectivity of regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2001

On cliques and bicliques.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Graphs with large total domination number.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Characterizations of trees with equal domination parameters.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2000

Total domination in graphs with minimum degree three.

[BibT_eX]

[DOI]

,

,

,

Joël Puech

J. Graph Theory, 2000

Graphs with least domination number three-fifths their order.

[BibT_eX]

[DOI]

Discret. Math., 2000

Bipartite Ramsey numbers and Zarankiewicz numbers.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2000

Restrained domination in trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2000

The domatic numbers of factors of graphs.

[BibT_eX]

,

Ars Comb., 2000

A characterization of domination 4-relative-critical graphs of diameter 5.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2000

Generalized eccentricity, radius, and diameter in graphs.

[BibT_eX]

[DOI]

,

,

,

Networks, 1999

Homogeneous Embeddings of Cycles in Graphs.

[BibT_eX]

[DOI]

,

,

Hiren Maharaj

Graphs Comb., 1999

Graphs with large restrained domination number.

[BibT_eX]

[DOI]

Discret. Math., 1999

Real and integer domination in graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1999

On perfect neighborhood sets in graphs.

[BibT_eX]

[DOI]

Gerd Fricke

,

Sandra Mitchell Hedetniemi

,

,

,

Discret. Math., 1999

Minus domination in graphs.

[BibT_eX]

[DOI]

Jean E. Dunbar

,

,

,

Alice A. McRae

Discret. Math., 1999

Queens graphs.

[BibT_eX]

[DOI]

Lowell W. Beineke

,

Izak Broere

,

Discret. Math., 1999

On the principal edge bipartition of a graph.

[BibT_eX]

[DOI]

,

C. H. C. Little

Australas. J Comb., 1999

Strict majority functions on graphs.

[BibT_eX]

[DOI]

,

Hugh R. Hind

J. Graph Theory, 1998

Packing in trees.

[BibT_eX]

[DOI]

Discret. Math., 1998

Star-path bipartite Ramsey numbers, .

[BibT_eX]

[DOI]

,

Discret. Math., 1998

Some General Aspects of the Framing Number of a Digraph.

[BibT_eX]

[DOI]

,

Hiren Maharaj

Discret. Appl. Math., 1998

Partial signed domination in graphs.

[BibT_eX]

,

Elna Ungerer

,

Ars Comb., 1998

Distance irredundance in graphs: complexity issues.

[BibT_eX]

,

,

Jacobus L. Walters

Ars Comb., 1998

Closed neighborhood order dominating functions.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1998

Domination critical graphs with respect to relative complements.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1998

A note on cliques and independent sets.

[BibT_eX]

[DOI]

Roger C. Entringer

,

,

J. Graph Theory, 1997

Opinion functions on trees.

[BibT_eX]

[DOI]

Lowell W. Beineke

,

Discret. Math., 1997

Switching Distance Graphs.

[BibT_eX]

John G. Gimbel

,

,

Ars Comb., 1997

Edge homogeneous embeddings of cycles in graphs.

[BibT_eX]

[DOI]

,

Hiren Maharaj

Australas. J Comb., 1997

Inequalities relating domination parameters in cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1996

Local edge domination critical graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1996

The diversity of domination.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1996

Minus domination in regular graphs.

[BibT_eX]

[DOI]

Jean E. Dunbar

,

,

,

Alice A. McRae

Discret. Math., 1996

An Algorithm to Find Two Distance Domination Parameters in a Graph.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 1996

The Algorithmic Complexity of Minus Domination in Graphs.

[BibT_eX]

[DOI]

Jean E. Dunbar

,

,

,

Alice A. McRae

,

Discret. Appl. Math., 1996

Domination in regular graphs.

[BibT_eX]

Ars Comb., 1996

Irredundance perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1995

Majority domination in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1995

Distance independence domination in graphs.

[BibT_eX]

Gerd Fricke

,

,

Ars Comb., 1995

The algorithmic complexity of signed domination in graphs.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 1995

Extremal results on defective colorings of graphs.

[BibT_eX]

[DOI]

Marietjie Frick

,

Discret. Math., 1994

Three-valued k-neighborhood domination in graphs.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 1994

On the integrity of distance domination in graphs.

[BibT_eX]

[DOI]

Timothy J. Bean

,

,

Australas. J Comb., 1994

Principal Common Divisors of Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 1993

Bounds relating generalized domination parameters.

[BibT_eX]

[DOI]

,

Discret. Math., 1993

On the computational complexity of upper distance fractional domination.

[BibT_eX]

[DOI]

,

,

Jakobus L. Walters

Australas. J Comb., 1993

Some nordhaus- gaddum-type results.

[BibT_eX]

[DOI]

,

,