default search action
Christian Löwenstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j33]Michael A. Henning, Christian Löwenstein, Anders Yeo:
The Tuza-Vestergaard Theorem. SIAM J. Discret. Math. 37(2): 1275-1310 (2023)
2010 – 2019
- 2017
- [j32]Michael A. Henning, Christian Löwenstein:
Domination game: extremal families for 3/5-conjecture for forests. Discuss. Math. Graph Theory 37(2): 369-381 (2017) - 2016
- [j31]Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse:
Locating-dominating sets in twin-free graphs. Discret. Appl. Math. 200: 52-58 (2016) - [j30]Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach:
Induced 2-regular subgraphs in k-chordal cubic graphs. Discret. Appl. Math. 205: 73-79 (2016) - [j29]Piotr Borowiecki, Michael Gentner, Christian Löwenstein, Dieter Rautenbach:
Independence in uniform linear triangle-free hypergraphs. Discret. Math. 339(7): 1878-1883 (2016) - [j28]Michael A. Henning, Christian Löwenstein:
A characterization of hypergraphs with large domination number. Discuss. Math. Graph Theory 36(2): 427-438 (2016) - [j27]Michael A. Henning, Felix Joos, Christian Löwenstein, Thomas Sasse:
Induced Cycles in Graphs. Graphs Comb. 32(6): 2425-2441 (2016) - [j26]Michael A. Henning, Christian Löwenstein:
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3. J. Graph Theory 83(2): 196-208 (2016) - 2014
- [j25]Michael A. Henning, Christian Löwenstein, Justin Southey, Anders Yeo:
A New Lower Bound on the Independence Number of a Graph and Applications. Electron. J. Comb. 21(1): 1 (2014) - [j24]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent domination in subcubic bipartite graphs of girth at least six. Discret. Appl. Math. 162: 399-403 (2014) - [j23]Simone Dantas, Felix Joos, Christian Löwenstein, Deiwison S. Machado, Dieter Rautenbach:
Domination and total domination in cubic graphs of large girth. Discret. Appl. Math. 174: 128-132 (2014) - [j22]Michael A. Henning, Christian Löwenstein:
An improved lower bound on the independence number of a graph. Discret. Appl. Math. 179: 120-128 (2014) - [j21]Michael A. Henning, Christian Löwenstein:
A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem. Discret. Math. 323: 69-75 (2014) - [j20]Christian Löwenstein, Dieter Rautenbach, Roman Soták:
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs. Discret. Math. Theor. Comput. Sci. 16(1): 7-30 (2014) - [j19]Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Graphs of interval count two with a given partition. Inf. Process. Lett. 114(10): 542-546 (2014) - [j18]Hossein Abdollahzadeh Ahangar, Michael A. Henning, Christian Löwenstein, Yancai Zhao, Vladimir Samodivkin:
Signed Roman domination in graphs. J. Comb. Optim. 27(2): 241-255 (2014) - 2013
- [j17]Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
Chiraptophobic Cockroaches evading a Torch Light. Ars Comb. 111: 181-192 (2013) - [j16]Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickaël Montassier, André Raspaud:
Generalized Power Domination in Regular Graphs. SIAM J. Discret. Math. 27(3): 1559-1574 (2013) - 2012
- [j15]Michael A. Henning, Christian Löwenstein:
Hypergraphs with large domination number and with edge sizes at least three. Discret. Appl. Math. 160(12): 1757-1765 (2012) - [j14]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent sets and matchings in subcubic graphs. Discret. Math. 312(11): 1900-1910 (2012) - [j13]Michael A. Henning, Christian Löwenstein:
Locating-total domination in claw-free cubic graphs. Discret. Math. 312(21): 3107-3116 (2012) - [j12]Christian Löwenstein, Dieter Rautenbach:
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. Graphs Comb. 28(3): 407-421 (2012) - 2011
- [j11]Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
On Hamiltonian paths in distance graphs. Appl. Math. Lett. 24(7): 1075-1079 (2011) - [j10]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Dominating sets, packings, and the maximum degree. Discret. Math. 311(18-19): 2031-2036 (2011) - [j9]Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen:
Independence, odd girth, and average degree. J. Graph Theory 67(2): 96-111 (2011) - 2010
- [j8]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
An independent dominating set in the complement of a minimum dominating set of a tree. Appl. Math. Lett. 23(1): 79-81 (2010) - [j7]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey:
Disjoint dominating and total dominating sets in graphs. Discret. Appl. Math. 158(15): 1615-1623 (2010) - [j6]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Partitioning a graph into a dominating set, a total dominating set, and something else. Discuss. Math. Graph Theory 30(4): 563-574 (2010) - [j5]Christian Löwenstein, Dieter Rautenbach:
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs. Graphs Comb. 26(3): 407-424 (2010) - [j4]Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer:
Cycle length parities and the chromatic number. J. Graph Theory 64(3): 210-218 (2010)
2000 – 2009
- 2009
- [j3]Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
On spanning tree congestion. Discret. Math. 309(13): 4653-4655 (2009) - [j2]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Remarks about disjoint dominating sets. Discret. Math. 309(23-24): 6451-6458 (2009) - 2008
- [j1]Christian Löwenstein, Dieter Rautenbach:
Domination in Graphs of Minimum Degree at least Two and Large Girth. Graphs Comb. 24(1): 37-46 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint