Lutz Volkmann

From MaRDI portal
Person:186197

Available identifiers

zbMath Open volkmann.lutzWikidataQ95993982 ScholiaQ95993982MaRDI QIDQ186197

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61509042024-03-07Paper
https://portal.mardi4nfdi.de/entity/Q61509242024-03-07Paper
https://portal.mardi4nfdi.de/entity/Q61913742024-03-07Paper
https://portal.mardi4nfdi.de/entity/Q61493192024-03-05Paper
https://portal.mardi4nfdi.de/entity/Q61493302024-03-05Paper
Weak signed Roman k-domination in digraphs2024-01-31Paper
Oriented diameter of maximal outerplanar graphs2023-10-04Paper
Total Italian domatic number of graphs2023-09-18Paper
https://portal.mardi4nfdi.de/entity/Q60977172023-06-07Paper
https://portal.mardi4nfdi.de/entity/Q61558562023-06-07Paper
https://portal.mardi4nfdi.de/entity/Q61558592023-06-07Paper
https://portal.mardi4nfdi.de/entity/Q61589422023-06-01Paper
Restrained Roman and restrained Italian domatic numbers of graphs2022-10-13Paper
Nordhaus–Gaddum type inequalities on the total Italian domination number in graphs2022-09-15Paper
Restrained double Roman domination of a graph2022-09-15Paper
Disprove of a conjecture on the doubly connected domination subdivision number2022-09-02Paper
The Roman domatic problem in graphs and digraphs: a survey2022-07-01Paper
Bounds on the nonnegative signed domination number of graphs2022-02-22Paper
Weak Signed Roman Domination in Digraphs2022-02-11Paper
Maximally and super connected multisplit graphs and digraphs2022-02-10Paper
https://portal.mardi4nfdi.de/entity/Q50210922022-01-12Paper
Multiple Domination2021-12-15Paper
Roman Domination in Graphs2021-12-15Paper
Varieties of Roman Domination2021-12-14Paper
https://portal.mardi4nfdi.de/entity/Q50160282021-12-10Paper
An upper bound on the double Roman domination number2021-11-15Paper
Weak signed Roman domination in graphs2021-09-09Paper
Nonnegative signed total Roman domination in graphs2021-09-09Paper
https://portal.mardi4nfdi.de/entity/Q49575332021-09-09Paper
https://portal.mardi4nfdi.de/entity/Q49575492021-09-09Paper
Signed total Italian k-domination in graphs2021-09-09Paper
https://portal.mardi4nfdi.de/entity/Q49571442021-09-03Paper
Varieties of Roman domination II2021-09-01Paper
The signed Roman domatic number of a digraph2021-08-16Paper
On the signed 2-independence number of graphs2021-08-16Paper
Remarks on the outer-independent double Italian domination number2021-07-30Paper
Nordhaus–Gaddum type results for connected and total domination2021-07-27Paper
https://portal.mardi4nfdi.de/entity/Q49952862021-06-23Paper
https://portal.mardi4nfdi.de/entity/Q49952922021-06-23Paper
https://portal.mardi4nfdi.de/entity/Q49953042021-06-23Paper
Bounds on the co-Roman domination number in graphs2021-04-23Paper
https://portal.mardi4nfdi.de/entity/Q58588722021-04-14Paper
Critical concept for double Roman domination in graphs2021-03-18Paper
Domination number, independent domination number and 2-independence number in trees2020-12-08Paper
https://portal.mardi4nfdi.de/entity/Q51330702020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q51330942020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q51332142020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q51332182020-11-12Paper
Graphs with large Italian domination number2020-11-05Paper
On the signed Roman k-domination in graphs2020-10-23Paper
A proof of a conjecture on the differential of a subcubic graph2020-10-14Paper
The double Roman domatic number of a digraph2020-08-26Paper
[https://portal.mardi4nfdi.de/wiki/Publication:3303523 Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs]2020-08-12Paper
Roman \(\{ 3 \}\)-domination (double Italian domination)2020-06-29Paper
Extremal digraphs for an upper bound on the double Roman domination number2020-03-11Paper
A note on the Roman domatic number of a digraph2020-01-30Paper
Total double Roman domination in graphs2020-01-30Paper
Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size2020-01-21Paper
https://portal.mardi4nfdi.de/entity/Q52065902019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52440002019-11-19Paper
Double Roman domination in digraphs2019-09-20Paper
https://portal.mardi4nfdi.de/entity/Q51976112019-09-19Paper
https://portal.mardi4nfdi.de/entity/Q53821342019-06-21Paper
The Roman \(\{2 \}\)-domatic number of graphs2019-03-22Paper
https://portal.mardi4nfdi.de/entity/Q46266602019-02-28Paper
On the co-Roman domination in graphs2019-02-07Paper
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number2019-02-07Paper
https://portal.mardi4nfdi.de/entity/Q46455732019-01-10Paper
Bounds on the signed Roman \(k\)-domination number of a digraph2018-12-05Paper
The restrained rainbow bondage number of a graph2018-09-17Paper
Lower bounds on the signed (total) $k$-domination number2018-08-31Paper
An introduction to the twin signed total k-domination numbers in directed graphs2018-08-08Paper
An upper bound on the double Roman domination number2018-07-26Paper
https://portal.mardi4nfdi.de/entity/Q45763192018-07-12Paper
https://portal.mardi4nfdi.de/entity/Q45662392018-06-14Paper
Double Roman domination and domatic numbers of graphs2018-04-13Paper
https://portal.mardi4nfdi.de/entity/Q46062132018-03-01Paper
https://portal.mardi4nfdi.de/entity/Q46040992018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q46041142018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q46043212018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q31343342018-02-09Paper
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number2017-12-20Paper
Sufficient conditions for maximally edge-connected and super-edge-connected graphs2017-12-20Paper
https://portal.mardi4nfdi.de/entity/Q45956562017-12-06Paper
Twin signed Roman domatic numbers in digraphs2017-11-20Paper
The signed total Roman \(k\)-domatic number of a graph2017-10-13Paper
Universal arcs in local tournaments2017-09-18Paper
https://portal.mardi4nfdi.de/entity/Q53545382017-09-04Paper
https://portal.mardi4nfdi.de/entity/Q53545422017-09-04Paper
Twin Roman domination number of a digraph2017-08-25Paper
https://portal.mardi4nfdi.de/entity/Q53500582017-08-25Paper
Graphs with large geodetic number2017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q52788092017-07-19Paper
Claw-free graphs with equal 2-domination and domination numbers2017-07-19Paper
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs2017-06-28Paper
Signed total Roman k-domination in directed graphs2017-06-28Paper
The Roman bondage number of a digraph2017-05-08Paper
New bounds on the rainbow domination subdivision number2017-04-11Paper
Signed total k-independence in digraphs2017-04-11Paper
The \(k\)-rainbow reinforcement numbers in graphs2017-03-15Paper
Roman game domination number of a graph2017-02-22Paper
Twin signed Roman domination numbers in directed graphs2017-02-09Paper
Signed total Roman domination in digraphs2017-01-23Paper
Signed Roman edge \(k\)-domination in graphs2017-01-23Paper
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs2016-12-28Paper
https://portal.mardi4nfdi.de/entity/Q28288632016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28288882016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28289522016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28289802016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28290982016-10-26Paper
Signed mixed Roman domination numbers in graphs2016-10-20Paper
Total restrained reinforcement in graphs2016-10-14Paper
Signed total Roman domination in graphs2016-10-12Paper
On the signed total Roman domination and domatic numbers of graphs2016-09-30Paper
The k-Rainbow Domination and Domatic Numbers of Digraphs2016-08-08Paper
https://portal.mardi4nfdi.de/entity/Q28160752016-07-01Paper
Graphs with unique dominating sets2016-07-01Paper
Edge-removal and edge-addition in \(\alpha \)-domination2016-06-09Paper
Signed Roman \(k\)-domination in digraphs2016-06-09Paper
Lower bounds on the signed total \(k\)-domination number of graphs2016-05-18Paper
Bounds on the inverse signed total domination numbers in graphs2016-05-18Paper
A note on the 2-rainbow bondage numbers in graphs2016-05-13Paper
Generalization of the total outer-connected domination in graphs2016-05-11Paper
New bounds on the signed total domination number of graphs2016-04-25Paper
https://portal.mardi4nfdi.de/entity/Q28007972016-04-18Paper
Signed Roman \(k\)-domination in graphs2016-03-02Paper
Signed Roman edge domination numbers in graphs2016-02-23Paper
Signed star (k,k)-domatic number of a graph2015-12-29Paper
https://portal.mardi4nfdi.de/entity/Q34521152015-11-18Paper
Upper bounds on the signed total \((k, k)\)-domatic number of graphs2015-11-17Paper
On the signed (total) \(k\)-independence number in graphs2015-11-17Paper
Upper bounds on the signed \((k,k)\)-domatic number of digraphs2015-10-15Paper
Signed Roman domination in digraphs2015-09-28Paper
https://portal.mardi4nfdi.de/entity/Q54999142015-08-05Paper
Global Roman domination in trees2015-07-20Paper
Signed star (j, k)-domatic numbers of digraphs2015-07-01Paper
Signed Roman \(k\)-domination in trees2015-05-22Paper
The \(k\)-rainbow bondage number of a digraph2015-05-11Paper
https://portal.mardi4nfdi.de/entity/Q49828972015-04-13Paper
https://portal.mardi4nfdi.de/entity/Q51737072015-02-16Paper
https://portal.mardi4nfdi.de/entity/Q29367002015-01-06Paper
https://portal.mardi4nfdi.de/entity/Q29335232014-12-03Paper
The signed Roman \(k\)-domatic number of a graph2014-11-28Paper
https://portal.mardi4nfdi.de/entity/Q29315072014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31891692014-09-09Paper
https://portal.mardi4nfdi.de/entity/Q28782132014-08-28Paper
The \(k\)-rainbow bondage number of a graph2014-08-22Paper
https://portal.mardi4nfdi.de/entity/Q28758912014-08-12Paper
Bounds on the signed 2-independence number in graphs2014-07-30Paper
https://portal.mardi4nfdi.de/entity/Q54208682014-06-13Paper
https://portal.mardi4nfdi.de/entity/Q54198532014-06-11Paper
A note on the independent domination number in graphs2014-04-23Paper
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four2014-04-22Paper
https://portal.mardi4nfdi.de/entity/Q54112162014-04-22Paper
Signed \(k\)-independence in graphs2014-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54039812014-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54010482014-03-12Paper
https://portal.mardi4nfdi.de/entity/Q54010652014-03-12Paper
https://portal.mardi4nfdi.de/entity/Q28708192014-01-21Paper
https://portal.mardi4nfdi.de/entity/Q28709472014-01-21Paper
Upper bounds on the signed (\(k, k\))-domatic number2013-12-23Paper
https://portal.mardi4nfdi.de/entity/Q28666012013-12-13Paper
Vertex-removal in α-domination2013-10-30Paper
https://portal.mardi4nfdi.de/entity/Q28532382013-10-18Paper
The roman \(k\)-domatic number of a graph2013-07-16Paper
https://portal.mardi4nfdi.de/entity/Q28396482013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q28396672013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q28397342013-07-12Paper
Roman domination dot-critical graphs2013-06-26Paper
Total restrained bondage in graphs2013-06-24Paper
https://portal.mardi4nfdi.de/entity/Q49248792013-06-10Paper
https://portal.mardi4nfdi.de/entity/Q49181182013-05-06Paper
https://portal.mardi4nfdi.de/entity/Q49134012013-04-05Paper
https://portal.mardi4nfdi.de/entity/Q49096892013-03-21Paper
Signed \(k\)-domatic numbers of digraphs2013-03-11Paper
On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs2013-03-11Paper
https://portal.mardi4nfdi.de/entity/Q49003522013-01-24Paper
Some results on roman domination edge critical graphs2013-01-02Paper
The distance Roman domatic number of a graph2013-01-02Paper
The total {k}-domatic number of digraphs2012-11-16Paper
https://portal.mardi4nfdi.de/entity/Q29185642012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q29186082012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q29145092012-09-20Paper
The Roman (k,k)-domatic number of a graph2012-09-18Paper
https://portal.mardi4nfdi.de/entity/Q29062672012-09-05Paper
Characterization of trees with equal 2-domination number and domination number plus two2012-09-05Paper
Connected global offensive k-alliances in graphs2012-09-05Paper
Roman bondage in graphs2012-09-05Paper
The k-rainbow domatic number of a graph2012-09-05Paper
SIGNED TOTAL {K}-DOMINATION AND {K}-DOMATIC NUMBERS OF GRAPHS2012-08-27Paper
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected2012-08-14Paper
Global offensive k-alliance in bipartite graphs2012-07-31Paper
https://portal.mardi4nfdi.de/entity/Q28953732012-07-02Paper
The total \(\{k\}\)-domatic number of a graph2012-05-23Paper
https://portal.mardi4nfdi.de/entity/Q31179642012-03-01Paper
https://portal.mardi4nfdi.de/entity/Q31180852012-03-01Paper
Signed total \((k,k)\)-domatic number of digraphs2012-02-22Paper
The \((j,k)\)-domatic number of a graph2012-01-26Paper
On the Roman \(k\)-bondage number of a graph2012-01-26Paper
On the Roman bondage number of planar graphs2012-01-24Paper
\(k\)-domination and \(k\)-independence in graphs: A survey2012-01-24Paper
Signed 2-independence in digraphs2012-01-11Paper
https://portal.mardi4nfdi.de/entity/Q31086002012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31086102012-01-05Paper
Roman domination dot-critical trees2011-12-01Paper
https://portal.mardi4nfdi.de/entity/Q30995302011-12-01Paper
https://portal.mardi4nfdi.de/entity/Q30995372011-12-01Paper
Bounds on the k-tuple domatic number of a graph2011-11-11Paper
The \(\{k\}\)-domatic number of a graph2011-10-11Paper
Signed domination and signed domatic numbers of digraphs2011-09-20Paper
https://portal.mardi4nfdi.de/entity/Q30892152011-08-24Paper
Unique response Roman domination in graphs2011-08-10Paper
Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph2011-07-11Paper
Signed total \((k,k)\)-domatic number of a graph2011-07-04Paper
https://portal.mardi4nfdi.de/entity/Q30041352011-05-31Paper
Upper bounds on the signed total domatic number of graphs2011-05-17Paper
Independence andk-domination in graphs2011-04-21Paper
https://portal.mardi4nfdi.de/entity/Q53935382011-04-18Paper
https://portal.mardi4nfdi.de/entity/Q53935412011-04-18Paper
https://portal.mardi4nfdi.de/entity/Q53922612011-04-08Paper
The signed \(k\)-domination number of directed graphs2011-03-15Paper
https://portal.mardi4nfdi.de/entity/Q30772072011-02-22Paper
A bound on the k-domination number of a graph2011-02-11Paper
The k-domatic number of a graph2011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30701972011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702972011-02-02Paper
A general method in the theory of domination in graphs2011-01-20Paper
The diameter of almost Eulerian digraphs2010-12-16Paper
https://portal.mardi4nfdi.de/entity/Q30589942010-12-08Paper
https://portal.mardi4nfdi.de/entity/Q30590052010-12-08Paper
k-independence stable graphs upon edge removal2010-12-08Paper
Bounds on the signed domatic number2010-12-01Paper
Proof of a conjecture on game domination2010-11-24Paper
Smallest close to regular bipartite graphs without an almost perfect matching2010-11-17Paper
https://portal.mardi4nfdi.de/entity/Q35816702010-09-02Paper
The roman domatic number of a graph2010-09-01Paper
Minimum size of a graph or digraph of given radius2010-08-20Paper
On the geodetic and geodetic domination numbers of a graph2010-07-07Paper
https://portal.mardi4nfdi.de/entity/Q35697852010-06-22Paper
https://portal.mardi4nfdi.de/entity/Q35674952010-06-17Paper
https://portal.mardi4nfdi.de/entity/Q35614272010-05-25Paper
Bounds on the global offensive k-alliance number in graphs2010-05-14Paper
Signed star domatic number of a graph2010-05-05Paper
Cycle factors in strongly connected local tournaments2010-04-27Paper
Restricted arc-connectivity of digraphs2010-03-24Paper
On local connectivity of graphs with given clique number2010-03-15Paper
Lower bounds on the vertex-connectivity of digraphs and graphs2010-01-29Paper
ROMAN k-DOMINATION IN GRAPHS2009-12-16Paper
On the connectivity of \(p\)-diamond-free graphs2009-12-15Paper
Inverse degree and edge-connectivity2009-12-09Paper
Some remarks on the signed domatic number of graphs with small minimum degree2009-11-06Paper
Degree sequence conditions for maximally edge-connected oriented graphs2009-10-30Paper
Note on the connectivity of line graphs2009-07-21Paper
https://portal.mardi4nfdi.de/entity/Q36355252009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36355712009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36355752009-07-06Paper
Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number2009-06-30Paper
The signed domatic number of some regular graphs2009-06-24Paper
Complementary cycles in regular multipartite tournaments, where one cycle has length five2009-06-23Paper
On the number of cycles in local tournaments2009-06-19Paper
Parity and disparity subgraphs2009-06-19Paper
On the existence of edge cuts leaving several large components2009-06-17Paper
https://portal.mardi4nfdi.de/entity/Q36249762009-05-06Paper
A remark on degree sequences of multigraphs2009-04-27Paper
2-domination subdivision number of graphs2009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36205662009-04-14Paper
Every cycle-connected multipartite tournament has a universal arc2009-04-09Paper
On the order of certain close to regular graphs without a matching of given size2009-03-31Paper
The connectivity of a graph and its complement2009-03-04Paper
A remark on the (2,2)-domination number2009-02-26Paper
Cycles with a given number of vertices from each partite set in regular multipartite tournaments2009-02-09Paper
On arc-traceable local tournaments2009-01-28Paper
Strong subtournaments containing a given vertex in regular multipartite tournaments2009-01-28Paper
Some remarks on \(\lambda _{p,q}\)-connectedness2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q55033532009-01-15Paper
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles2008-12-17Paper
Onk-domination and minimum degree in graphs2008-11-19Paper
Weakly Complementary Cycles in 3-Connected Multipartite Tournaments2008-09-25Paper
https://portal.mardi4nfdi.de/entity/Q35171702008-08-12Paper
\(\alpha \)-domination perfect trees2008-07-11Paper
Maximally edge-connected and vertex-connected graphs and digraphs: A survey2008-07-11Paper
Extremal bipartite graphs with a unique k-factor2008-07-01Paper
A lower bound for the irredundance number of trees2008-07-01Paper
https://portal.mardi4nfdi.de/entity/Q35072632008-06-18Paper
All 2-connected in-tournaments that are cycle complementary2008-04-28Paper
On graphs with equal domination and 2-domination numbers2008-04-28Paper
Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)2008-03-13Paper
https://portal.mardi4nfdi.de/entity/Q54491682008-03-11Paper
https://portal.mardi4nfdi.de/entity/Q54491692008-03-11Paper
On local connectivity of graphs2008-02-25Paper
https://portal.mardi4nfdi.de/entity/Q54443822008-02-25Paper
https://portal.mardi4nfdi.de/entity/Q54421592008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54425102008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54425482008-02-22Paper
Characterization of block graphs with equal 2-domination number and domination number plus one2008-02-22Paper
A remark on cycles through an arc in strongly connected multipartite tournaments2008-02-14Paper
Multipartite tournaments: a survey2007-12-06Paper
Local-edge-connectivity in digraphs and oriented graphs2007-12-06Paper
Strongly 4-path-connectivity in almost regular multipartite tournaments2007-12-06Paper
New bounds on the \(k\)-domination number and the \(k\)-tuple domination number2007-12-06Paper
CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS2007-10-22Paper
On the connectivity of diamond-free graphs2007-09-21Paper
https://portal.mardi4nfdi.de/entity/Q53102052007-09-21Paper
Distance domination and distance irredundance in graphs2007-07-16Paper
A short proof of a theorem of Kano and Yu on factors in regular graphs2007-07-16Paper
https://portal.mardi4nfdi.de/entity/Q34239832007-02-15Paper
https://portal.mardi4nfdi.de/entity/Q34219522007-02-08Paper
Longest cycles in almost regular 3-partite tournaments2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q34088532006-11-15Paper
Paths with a given number of vertices from each partite set in regular multipartite tournaments2006-10-30Paper
https://portal.mardi4nfdi.de/entity/Q54925902006-10-16Paper
On the p-domination number of cactus graphs2006-10-16Paper
Some bounds on the \(p\)-domination number in trees2006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883552006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54879132006-09-13Paper
On cycles in regular 3-partite tournaments2006-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54807092006-08-03Paper
Structural remarks on bipartite graphs with unique \(f\)-factors2006-06-16Paper
On the connectivity of close to regular multipartite tournaments2006-06-09Paper
On connectivity in graphs with given clique number2006-06-06Paper
https://portal.mardi4nfdi.de/entity/Q54688912006-05-03Paper
Otto Blumenthal (1876--1944) in retrospect2006-03-20Paper
https://portal.mardi4nfdi.de/entity/Q33664992006-02-14Paper
A lower bound for the distance \(k\)-domination number of trees2006-01-13Paper
Unique irredundance, domination and independent domination in graphs2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q57104472005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q57090062005-11-21Paper
Signed domatic number of a graph2005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q54660602005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54660872005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54633572005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54635032005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54617032005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q27160222005-07-20Paper
https://portal.mardi4nfdi.de/entity/Q46819902005-06-09Paper
Cuts leaving components of given minimum order2005-04-28Paper
Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected2005-04-21Paper
Some remarks on alpha-domination2005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46595862005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46595892005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46603302005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46576922005-03-14Paper
A note on the number of matchings and independent sets in trees2005-02-23Paper
The maximum size of graphs with a unique \(k\)-factor2005-02-14Paper
Extendable cycles in multipartite tournaments2004-12-13Paper
The Petersen graph is not 1-factorable: postscript to `The Petersen graph is not 3-edge-colorable -- a new proof' [Discrete Math. 268 (2003) 325--326]2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48262682004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48262842004-11-11Paper
Neighborhood and degree conditions for super-edge-connected bipartite digraphs2004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48187912004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48208212004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48208392004-10-01Paper
Vertex 6-pancyclic in-tournaments2004-08-19Paper
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc2004-08-19Paper
Hamiltonian paths containing a given arc, in almost regular bipartite tournaments2004-08-19Paper
All regular multipartite tournaments that are cycle complementary2004-08-06Paper
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments2004-08-06Paper
Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 22004-08-06Paper
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44605642004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44575542004-03-25Paper
https://portal.mardi4nfdi.de/entity/Q44575592004-03-25Paper
On unique \(k\)-factors and unique \([1,k\)-factors in graphs.]2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44329352004-02-10Paper
On regular factors in regular graphs with small radius2004-02-05Paper
Relations between the lower domination parameters and the chromatic number of a graph.2004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q44056522003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q44056342003-09-30Paper
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs2003-09-04Paper
A linear-programming approach to the generalized Randić index2003-06-10Paper
https://portal.mardi4nfdi.de/entity/Q47805092003-04-11Paper
Extremal subgraphs with respect to vertex degree bounds2003-04-09Paper
Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number2003-04-03Paper
Proof of a conjecture on irredundance perfect graphs2003-03-19Paper
Independent domination and matchings in graphs2003-03-16Paper
Remarks on the bondage number of planar graphs2003-03-16Paper
Maximum graphs with a unique minimum dominating set2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31472652003-03-09Paper
https://portal.mardi4nfdi.de/entity/Q44432582003-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45295162002-12-11Paper
Edge-cuts leaving components of order at least three2002-12-02Paper
Longest paths through an arc in strong semicomplete multipartite digraphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44885632002-12-02Paper
A Remark on a Problem of Rolf Nevanlinna2002-10-22Paper
How local irregularity gets global in a graph2002-09-29Paper
Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic2002-09-25Paper
Graphs having distance-\(n\) domination number half their order2002-08-29Paper
Vertex pancyclic graphs2002-08-29Paper
Wiener index versus maximum degree in trees2002-08-29Paper
Weighted domination in triangle-free graphs2002-08-29Paper
A disproof of Henning's conjecture on irredundance perfect graphs2002-08-29Paper
Cycles in multipartite tournaments: Results and problems2002-05-15Paper
\(i\gamma(1)\)-perfect graphs2002-05-07Paper
A characterization of \(\Gamma\alpha(k)\)-perfect graphs2001-12-10Paper
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs2001-11-28Paper
https://portal.mardi4nfdi.de/entity/Q27079762001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q27530562001-10-23Paper
https://portal.mardi4nfdi.de/entity/Q27413342001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q27413422001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q27413622001-09-23Paper
The domatic number of block-cactus graphs2000-11-02Paper
Characterization of graphs with equal domination and covering number2000-11-02Paper
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian2000-09-05Paper
Degree sequence conditions for maximally edge-connected graphs depending on the clique number2000-07-30Paper
https://portal.mardi4nfdi.de/entity/Q49435152000-07-13Paper
Vertex deletion and cycles in multipartite tournaments2000-07-05Paper
https://portal.mardi4nfdi.de/entity/Q42694432000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q49400522000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42672051999-09-22Paper
Longest paths in semicomplete multipartite digraphs1999-08-09Paper
https://portal.mardi4nfdi.de/entity/Q42220941999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q38425341998-11-01Paper
https://portal.mardi4nfdi.de/entity/Q43786391998-08-31Paper
The rati of the irredundance and domination number of a graph1998-06-01Paper
Bypaths in tournaments1998-02-01Paper
Estimations for the number of cycles in a graph1998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43550691997-12-22Paper
On cycles through a given vertex in multipartite tournaments1997-06-10Paper
A classification of locally semicomplete digraphs1997-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48949661997-01-26Paper
Independence number in \(n\)-extendable graphs1997-01-05Paper
https://portal.mardi4nfdi.de/entity/Q48651321996-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48829641996-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48566321996-06-18Paper
A complete solution of a problem of Bondy concerning multipartite tournaments1996-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48655211996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48655241996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48626781996-02-11Paper
Regular graphs, regular factors, and the impact of Petersen's theorems1995-10-05Paper
https://portal.mardi4nfdi.de/entity/Q48427221995-08-16Paper
A generalization of Menger's theorem for certain block-cactus graphs1995-05-11Paper
Cycles in multipartite tournaments1995-03-08Paper
On complementary cycles in locally semicomplete digraphs1995-02-01Paper
https://portal.mardi4nfdi.de/entity/Q43043381995-01-26Paper
On unique independent sets in graphs1994-09-27Paper
On graphs with equal domination and covering numbers1994-07-31Paper
Connectivity properties of locally semicomplete digraphs1994-06-06Paper
Sufficient conditions for equality of connectivity and minimum degree of a graph1994-03-24Paper
Some upper bounds for the product of the domination number and the chromatic number of a graph1994-01-04Paper
A new domination conception1993-08-24Paper
A generalization of a theorem of Marcinkiewicz1993-03-01Paper
https://portal.mardi4nfdi.de/entity/Q40143061992-10-06Paper
https://portal.mardi4nfdi.de/entity/Q40080491992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40134561992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39954091992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39958781992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39994651992-09-17Paper
On graphs with equal domination and independent domination numbers1992-06-28Paper
On packing and covering numbers of graphs1992-06-28Paper
Factors of Locally almost Regular Graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39725111992-06-25Paper
On domination and independence numbers of graphs1992-06-25Paper
Edge‐connectivity in p‐partite graphs1992-06-25Paper
Estimations for the domination number of a graph1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33513851990-01-01Paper
Funktional-differentialgleichungen mit meromorphen lösungen endlicher wachstumsordnung*1990-01-01Paper
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37942151988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340731988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353291987-01-01Paper
Anwenclungen einer methode von goldberg und fuchs in der theorie der ganzen und meromorphen funktionen1987-01-01Paper
On the characterization of the function \(f(x)=x\) by functional equations. II1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37333681986-01-01Paper
Meromorphe funktionen, die mit ihrer ersten und zweiten ableitung einen endlichen wert teilen1986-01-01Paper
Über faktorisierbare Lösungen Riccatischer Differentialgleichungen1986-01-01Paper
Eine direkte methode zur bestimmung der wachstumsordnung der lösungen von differentialgleichungssystemen1986-01-01Paper
Über die Charakterisierung der Funktion \(f(x)=x\) durch Funktionalgleichungen. I1985-01-01Paper
Anwendungen der werteverteilung auf funktional-und funktional differentialgleichungen1985-01-01Paper
Wachstumsverhalten zusammengesetzter Funktionen1984-01-01Paper
Wachstumseigenschaften ganzer Funktionen mit negativen Nullstellen1983-01-01Paper
On the type of entire functions of finite iterated order1983-01-01Paper
Ein elementarer beweis des satzes von malmquist-yosida-steinmetz1983-01-01Paper
Abschätzungen eines weierstraßproduktes und anwendungen auf meromorphe funktionen endlicher iterierter ordnung1983-01-01Paper
Untersuchungen ganzer und meromorpher Funktionen unendlicher Ordnung1982-01-01Paper
Anwendungen einer Methode von Polya in der Theorie der ganzen Funktionen1979-01-01Paper
Koeffizientenabschätzungen für Funktionen, deren erste Ableitung beschränktes Argument hat1979-01-01Paper
Zusammenhänge zwischen dem Maximalbetrag und einer Nullstellenfunktion bei ganzen Funktionen1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41655761978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41696011978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41866091978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41358411977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41358421977-01-01Paper
Ganze Funktionen mit negativen Nullstellen.1977-01-01Paper
Über Zusammenhänge zwischen den Nullstellen und dem Zentralindex ganzer Funktionen1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41469671975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41505151974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Lutz Volkmann