The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Lutz Volkmann" ( http://dblp.L3S.de/Authors/Lutz_Volkmann )

URL (Homepage):  http://www.math2.rwth-aachen.de/de/mitarbeiter/volkm  Author page on DBLP  Author page in RDF  Community of Lutz Volkmann in ASPL-2

Publication years (Num. hits)
1990-1997 (17) 1998-2001 (15) 2002-2003 (18) 2004 (15) 2005-2006 (21) 2007-2008 (26) 2009-2010 (21) 2011-2012 (14)
Publication types (Num. hits)
article(146) book(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

Results
Found 147 publication records. Showing 147 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Seyed Mahmoud Sheikholeslami, Lutz Volkmann The total {k}-domatic number of a graph. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Signed 2-independence in digraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann k-Domination and k-Independence in Graphs: A Survey. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Seyed Mahmoud Sheikholeslami, Lutz Volkmann The k-rainbow domatic number of a graph. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2012 DBLP  BibTeX  RDF
1Dirk Meierling, Seyed Mahmoud Sheikholeslami, Lutz Volkmann Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Bounds on the signed domatic number. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nader Jafari Rad, Lutz Volkmann On the Roman Bondage Number of Planar Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Connected global offensive k-alliances in graphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2011 DBLP  BibTeX  RDF
1Lutz Volkmann Signed domination and signed domatic numbers of digraphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2011 DBLP  BibTeX  RDF
1Mustapha Chellali, Lutz Volkmann Characterization of trees with equal 2-domination number and domination number plus two. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2011 DBLP  BibTeX  RDF
1Nader Jafari Rad, Lutz Volkmann Roman bondage in graphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2011 DBLP  BibTeX  RDF
1E. Ebrahimi Targhi, Nader Jafari Rad, Lutz Volkmann Unique response Roman domination in graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Upper bounds on the signed total domatic number of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Adriana Hansberg, Dirk Meierling, Lutz Volkmann Independence and k-domination in graphs. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dirk Meierling, Lutz Volkmann Cycle factors in strongly connected local tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Adriana Hansberg, Lutz Volkmann On the geodetic and geodetic domination numbers of a graph. Search on Bibsonomy Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Seyed Mahmoud Sheikholeslami, Lutz Volkmann The Roman domatic number of a graph. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Dankelmann, Lutz Volkmann The Diameter of Almost Eulerian Digraphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2010 DBLP  BibTeX  RDF
1Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann k-independence stable graphs upon edge removal. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2010 DBLP  BibTeX  RDF
1Odile Favaron, Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann Proof of a conjecture on game domination. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Holtkamp, Lutz Volkmann On local connectivity of graphs with given clique number. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1M. Atapour, Seyed Mahmoud Sheikholeslami, A. N. Ghameshlou, Lutz Volkmann Signed star domatic number of a graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Adriana Hansberg, Dirk Meierling, Lutz Volkmann A general method in the theory of domination in graphs. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Dankelmann, Lutz Volkmann Minimum size of a graph or digraph of given radius. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Dankelmann, Angelika Hellwig, Lutz Volkmann Inverse degree and edge-connectivity. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dirk Meierling, Lutz Volkmann On the number of cycles in local tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Holtkamp, Lutz Volkmann On the connectivity of p-diamond-free graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Terry A. McKee, Lutz Volkmann Parity and disparity subgraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen Every cycle-connected multipartite tournament has a universal arc. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dieter Rautenbach, Lutz Volkmann On the existence of edge cuts leaving several large components. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen Complementary cycles in regular multipartite tournaments, where one cycle has length five. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Some remarks on the signed domatic number of graphs with small minimum degree. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann Bounds on the global offensive k-alliance number in graphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2009 DBLP  BibTeX  RDF
1Dirk Meierling, Lutz Volkmann, Stephan Zitzen The signed domatic number of some regular graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Adriana Hansberg, Lutz Volkmann Upper bounds on the k-domination number and the k-Roman domination number. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen Strong subtournaments containing a given vertex in regular multipartite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dieter Rautenbach, Lutz Volkmann Some remarks on lambdap, q-connectedness. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dirk Meierling, Lutz Volkmann All 2-connected in-tournaments that are cycle complementary. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dirk Meierling, Lutz Volkmann On arc-traceable local tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Angelika Hellwig, Lutz Volkmann Maximally edge-connected and vertex-connected graphs and digraphs: A survey. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1F. Dahme, Dieter Rautenbach, Lutz Volkmann alpha-Domination perfect trees. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adriana Hansberg, Lutz Volkmann On graphs with equal domination and 2-domination numbers. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dieter Rautenbach, Lutz Volkmann Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Search on Bibsonomy Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann On local connectivity of graphs. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Torsten Korneffel, Dirk Meierling, Lutz Volkmann A remark on the (2, 2)-domination number. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2008 DBLP  BibTeX  RDF
1Odile Favaron, Adriana Hansberg, Lutz Volkmann On k-domination and minimum degree in graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Angelika Hellwig, Lutz Volkmann The connectivity of a graph and its complement. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Irene Stella, Lutz Volkmann, Stefan Winzen How close to regular must a multipartite tournament be to secure a given path covering number? Search on Bibsonomy Ars Comb. The full citation details ... 2008 DBLP  BibTeX  RDF
1Lutz Volkmann Restricted arc-connectivity of digraphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Local-edge-connectivity in digraphs and oriented graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Irene Stella, Lutz Volkmann, Stefan Winzen Strongly 4-path-connectivity in almost regular multipartite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Multipartite tournaments: A survey. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dieter Rautenbach, Lutz Volkmann New bounds on the k-domination number and the k-tuple domination number. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann A remark on cycles through an arc in strongly connected multipartite tournaments. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2007 DBLP  BibTeX  RDF
1Adriana Hansberg, Dirk Meierling, Lutz Volkmann Distance Domination and Distance Irredundance in Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2007 DBLP  BibTeX  RDF
1Adriana Hansberg Pastor, Lutz Volkmann Characterization of block graphs with equal 2-domination number and domination number plus one. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2007 DBLP  BibTeX  RDF
1Peter Dankelmann, Angelika Hellwig, Lutz Volkmann On the connectivity of diamond-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sabine Klinkenberg, Lutz Volkmann On the order of close to regular graphs without a matching of given size. Search on Bibsonomy Ars Comb. The full citation details ... 2007 DBLP  BibTeX  RDF
1Peter Dankelmann, Lutz Volkmann Average distance in bipartite tournaments. Search on Bibsonomy Ars Comb. The full citation details ... 2007 DBLP  BibTeX  RDF
1Angelika Hellwig, Lutz Volkmann Lower bounds on the vertex-connectivity of digraphs and graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Paul L. Butzer, Lutz Volkmann Otto Blumenthal (1876-1944) in retrospect. Search on Bibsonomy Journal of Approximation Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Mostafa Blidia, Mustapha Chellali, Lutz Volkmann Some bounds on the p-domination number in trees. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen Paths with a given number of vertices from each partite set in regular multipartite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Longest cycles in almost regular 3-partite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann On cycles in regular 3-partite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Degree sequence conditions for maximally edge-connected oriented graphs. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Arne Hoffmann, Elzbieta Sidorowicz, Lutz Volkmann Extremal bipartite graphs with a unique k-factor. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2006 DBLP  BibTeX  RDF
1Michael Poschen, Lutz Volkmann A lower bound for the irredundance number of trees. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2006 DBLP  BibTeX  RDF
1Angelika Hellwig, Lutz Volkmann On connectivity in graphs with given clique number. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen On the connectivity of close to regular multipartite tournaments. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Upper bounds on the domination number of a graph in terms of order and minimum degree. Search on Bibsonomy Ars Comb. The full citation details ... 2006 DBLP  BibTeX  RDF
1Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann Cuts leaving components of given minimum order. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich Unique irredundance, domination and independent domination in graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Arne Hoffmann, Lutz Volkmann Structural Remarks on Bipartite Graphs with Unique f-Factors. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classificiation Primary 05C70, Secondary 05C35
1Mostafa Blidia, Mustapha Chellali, Lutz Volkmann On the p-domination number of cactus graphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2005 DBLP  BibTeX  RDF
1Angelika Hellwig, Lutz Volkmann Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Bohdan Zelinka Signed domatic number of a graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach A note on the number of matchings and independent sets in trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Dankelmann, Lutz Volkmann Average distance in k-connected tournaments. Search on Bibsonomy Ars Comb. The full citation details ... 2005 DBLP  BibTeX  RDF
1Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann Extremal Trees with Respect to Dominance Order. Search on Bibsonomy Ars Comb. The full citation details ... 2005 DBLP  BibTeX  RDF
1Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann Note on the connectivity of line graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Mustapha Chellali, Lutz Volkmann Relations between the lower domination parameters and the chromatic number of a graph. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann 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]. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Anders Yeo Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann All regular multipartite tournaments that are cycle complementary. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Angelika Hellwig, Lutz Volkmann Sufficient conditions for lambda'-optimality in graphs of diameter 2. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Arne Hoffmann, Lutz Volkmann On unique k-factors and unique [1, k]-factors in graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Christian Peters, Lutz Volkmann Vertex 6-pancyclic in-tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lutz Volkmann, Stefan Winzen Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Arne Hoffmann, Lutz Volkmann On Regular Factors in Regular Graphs with Small Radius. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2004 DBLP  BibTeX  RDF
1Yubao Guo, Lutz Volkmann Extendable Cycles in Multipartite Tournaments. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Multipartite tournaments, Extendable cycles, Cycles
1Lutz Volkmann The Maximum Size Of Graphs With A Unique k- Factor. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70
1Angelika Hellwig, Lutz Volkmann Maximally local-edge-connected graphs and digraphs. Search on Bibsonomy Ars Comb. The full citation details ... 2004 DBLP  BibTeX  RDF
1Dieter Rautenbach, Lutz Volkmann Extremal subgraphs with respect to vertex degree bounds. Search on Bibsonomy Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann Remarks on the bondage number of planar graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann Maximum graphs with a unique minimum dominating set. Search on Bibsonomy Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 147 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.