Christian Löwenstein

According to our database1, Christian Löwenstein authored at least 32 papers between 2008 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

Induced Cycles in Graphs.
Graphs Comb., 2016

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

Independence in uniform linear triangle-free hypergraphs.
Discret. Math., 2016

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

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

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

Graphs of interval count two with a given partition.
Inf. Process. Lett., 2014

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs.
Discret. Math. Theor. Comput. Sci., 2014

A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem.
Discret. 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

Domination and total domination in cubic graphs of large girth.
Discret. Appl. Math., 2014

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

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

Chiraptophobic Cockroaches evading a Torch Light.
Ars Comb., 2013

2012
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs.
Graphs Comb., 2012

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

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

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

2011
Independence, odd girth, and average degree.
J. Graph Theory, 2011

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

On Hamiltonian paths in distance graphs.
Appl. Math. Lett., 2011

2010
Cycle length parities and the chromatic number.
J. Graph Theory, 2010

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs.
Graphs Comb., 2010

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

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

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

2009
On spanning tree congestion.
Discret. Math., 2009

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

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


  Loading...