Christian Löwenstein

,

,

Anders Yeo

SIAM J. Discret. Math., June, 2023

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

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2017

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

[BibT_eX]

[DOI]

,

J. Graph Theory, 2016

Induced Cycles in Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2016

A characterization of hypergraphs with large domination number.

[BibT_eX]

[DOI]

,

Hossein Abdollahzadeh Ahangar

Discuss. Math. Graph Theory, 2016

Independence in uniform linear triangle-free hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2016

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

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

Locating-dominating sets in twin-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

Signed Roman domination in graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Optim., 2014

Graphs of interval count two with a given partition.

[BibT_eX]

[DOI]

Felix Joos

,

,

Fabiano de S. Oliveira

,

,

Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2014

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs.

[BibT_eX]

[DOI]

,

,

Roman Soták

Discret. Math. Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

,

Discret. 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

Domination and total domination in cubic graphs of large girth.

[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

Generalized Power Domination in Regular Graphs.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2013

Chiraptophobic Cockroaches evading a Torch Light.

[BibT_eX]

,

,

Friedrich Regen

Ars Comb., 2013

Pairs of Disjoint Dominating Sets in Connected Cubic Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 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

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

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

Independence, odd girth, and average degree.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2011

Dominating sets, packings, and the maximum degree.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2011

On Hamiltonian paths in distance graphs.

[BibT_eX]

[DOI]

,

,

Friedrich Regen

Appl. Math. Lett., 2011

Cycle length parities and the chromatic number.

[BibT_eX]

[DOI]

,

,

Ingo Schiermeyer

J. Graph Theory, 2010

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2010

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

[BibT_eX]

[DOI]

,

,

Discuss. Math. Graph Theory, 2010

Disjoint dominating and total dominating sets in graphs.

[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

On spanning tree congestion.

[BibT_eX]

[DOI]

,

,

Friedrich Regen

Discret. Math., 2009

Remarks about disjoint dominating sets.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

Domination in Graphs of Minimum Degree at least Two and Large Girth.

[BibT_eX]

[DOI]

,