The following pages link to Christian Löwenstein (Q400533):
Displaying 37 items.
- (Q266934) (redirect page) (← links)
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- A characterization of hypergraphs with large domination number (Q274700) (← links)
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Hypergraphs with large transversal number and with edge sizes at least four (Q424115) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- Hypergraphs with large domination number and with edge sizes at least three (Q444441) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Induced cycles in graphs (Q503635) (← links)
- Domination game: extremal families for the 3/5-conjecture for forests (Q521754) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Dominating sets, packings, and the maximum degree (Q641164) (← links)
- Independent domination in subcubic bipartite graphs of girth at least six (Q741773) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- An independent dominating set in the complement of a minimum dominating set of a tree (Q1049262) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem (Q2439129) (← links)
- Signed Roman domination in graphs (Q2444148) (← links)
- Domination in graphs of minimum degree at least two and large girth (Q2482352) (← links)
- The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
- Generalized Power Domination in Regular Graphs (Q2870522) (← links)
- (Q2931479) (← links)
- Partitioning a graph into a dominating set, a total dominating set, and something else (Q2997583) (← links)
- Independence, odd girth, and average degree (Q3005112) (← links)
- Cycle length parities and the chromatic number (Q3055917) (← links)
- (Q3108617) (← links)
- (Q5413900) (← links)
- Relating ordinary and total domination in cubic graphs of large girth (Q5419942) (← links)
- The Tuza–Vestergaard Theorem (Q6161262) (← links)
