Christian Löwenstein

From MaRDI portal
Revision as of 03:18, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:400533

Available identifiers

zbMath Open lowenstein.christianMaRDI QIDQ400533

List of research outcomes





PublicationDate of PublicationType
The Tuza–Vestergaard Theorem2023-06-27Paper
Domination game: extremal families for the 3/5-conjecture for forests2017-04-12Paper
Induced cycles in graphs2017-01-13Paper
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 32016-10-13Paper
Independence in uniform linear triangle-free hypergraphs2016-04-27Paper
A characterization of hypergraphs with large domination number2016-04-25Paper
Induced 2-regular subgraphs in \(k\)-chordal cubic graphs2016-04-07Paper
Locating-dominating sets in twin-free graphs2016-01-21Paper
An improved lower bound on the independence number of a graph2014-12-03Paper
https://portal.mardi4nfdi.de/entity/Q29314792014-11-25Paper
Independent domination in subcubic bipartite graphs of girth at least six2014-09-12Paper
A new lower bound on the independence number of a graph and applications2014-09-04Paper
Domination and total domination in cubic graphs of large girth2014-08-22Paper
Graphs of interval count two with a given partition2014-06-23Paper
Relating ordinary and total domination in cubic graphs of large girth2014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54139002014-05-02Paper
Signed Roman domination in graphs2014-04-08Paper
A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem2014-03-07Paper
Generalized Power Domination in Regular Graphs2014-01-21Paper
Pairs of disjoint dominating sets in connected cubic graphs2012-12-27Paper
Locating-total domination in claw-free cubic graphs2012-10-16Paper
Hypergraphs with large domination number and with edge sizes at least three2012-08-14Paper
Independent sets and matchings in subcubic graphs2012-06-18Paper
Hypergraphs with large transversal number and with edge sizes at least four2012-05-31Paper
https://portal.mardi4nfdi.de/entity/Q31086172012-01-05Paper
Dominating sets, packings, and the maximum degree2011-10-21Paper
Independence, odd girth, and average degree2011-06-07Paper
Partitioning a graph into a dominating set, a total dominating set, and something else2011-05-09Paper
On Hamiltonian paths in distance graphs2011-05-03Paper
Cycle length parities and the chromatic number2010-11-10Paper
Disjoint dominating and total dominating sets in graphs2010-11-05Paper
Pairs of disjoint dominating sets and the minimum degree of graphs2010-10-07Paper
An independent dominating set in the complement of a minimum dominating set of a tree2010-01-08Paper
Remarks about disjoint dominating sets2009-12-15Paper
On spanning tree congestion2009-12-10Paper
Domination in graphs of minimum degree at least two and large girth2008-04-16Paper

Research outcomes over time

This page was built for person: Christian Löwenstein