The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Lutz Volkmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dieter Rautenbach, Lutz Volkmann
    New bounds on the k-domination number and the k-tuple domination number. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2007, v:20, n:1, pp:98-102 [Journal]
  2. Lutz Volkmann
    Degree sequence conditions for maximally edge-connected oriented graphs. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:11, pp:1255-1260 [Journal]
  3. Peter Dankelmann, Lutz Volkmann
    Average distance in k-connected tournaments. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  4. Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
    Extremal Trees with Respect to Dominance Order. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  5. Angelika Hellwig, Lutz Volkmann
    Maximally local-edge-connected graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  6. Ursala Lenkewitz, Lutz Volkmann
    Neighbourhood and degree conditions for the existence of regular factors. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  7. Bert Randerath, Lutz Volkmann
    Simplicial Graphs and Relationships to Different Graph Invariants. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:46, n:, pp:- [Journal]
  8. Nicola Ueffing, Lutz Volkmann
    Restricted edge-connectivity and minimum edge-degree. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:66, n:, pp:- [Journal]
  9. Lutz Volkmann
    Spanning multipartite tournaments of semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  10. Lutz Volkmann
    Degree sequence conditions for super-edge-connected graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  11. Lutz Volkmann
    Cycles of length four through a given arc in almost regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:68, n:, pp:- [Journal]
  12. Lutz Volkmann
    The Maximum Size Of Graphs With A Unique k- Factor. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:531-540 [Journal]
  13. Arne Hoffmann, Lutz Volkmann
    On Regular Factors in Regular Graphs with Small Radius. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  14. Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann
    Wiener index versus maximum degree in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:127-137 [Journal]
  15. Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann
    A Linear-programming Approach to the Generalized Randic Index. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:375-385 [Journal]
  16. Miranca Fischermann, Lutz Volkmann
    Graphs having distance-n domination number half their order. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:97-107 [Journal]
  17. Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach
    A note on the number of matchings and independent sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:483-489 [Journal]
  18. Yubao Guo, Lutz Volkmann
    Bypaths in Tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:127-135 [Journal]
  19. Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
    Vertex pancyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:219-237 [Journal]
  20. Lutz Volkmann
    on Graphs with Equal Domination and Covering Numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:211-217 [Journal]
  21. Lutz Volkmann, Bohdan Zelinka
    Signed domatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:261-267 [Journal]
  22. Lutz Volkmann, Stefan Winzen
    On the connectivity of close to regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1437-1452 [Journal]
  23. Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann
    Edge-cuts leaving components of order at least three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:431-439 [Journal]
  24. Mustapha Chellali, Lutz Volkmann
    Relations between the lower domination parameters and the chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:1-8 [Journal]
  25. Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
    Weighted domination in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:233-239 [Journal]
  26. Peter Dankelmann, Lutz Volkmann
    Degree sequence conditions for maximally edge-connected graphs depending on the clique number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:217-223 [Journal]
  27. Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
    A characterization of rho alpha(k)-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:224, n:1-3, pp:265-271 [Journal]
  28. Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
    i gamma(1)-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:133-138 [Journal]
  29. Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
    Remarks on the bondage number of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:57-67 [Journal]
  30. Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
    Maximum graphs with a unique minimum dominating set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:197-203 [Journal]
  31. Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich
    Unique irredundance, domination and independent domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:190-200 [Journal]
  32. Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo
    Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:91-100 [Journal]
  33. Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
    Cuts leaving components of given minimum order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:292, n:1-3, pp:55-65 [Journal]
  34. Angelika Hellwig, Lutz Volkmann
    Sufficient conditions for lambda'-optimality in graphs of diameter 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:113-120 [Journal]
  35. Arne Hoffmann, Lutz Volkmann
    On unique k-factors and unique [1, k]-factors in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:127-138 [Journal]
  36. Christian Peters, Lutz Volkmann
    Vertex 6-pancyclic in-tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:227-238 [Journal]
  37. Dieter Rautenbach, Lutz Volkmann
    Independent domination and matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:325-330 [Journal]
  38. Dieter Rautenbach, Lutz Volkmann
    On alphargammas(k)-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:240-249 [Journal]
  39. Dieter Rautenbach, Lutz Volkmann
    Extremal subgraphs with respect to vertex degree bounds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:297-303 [Journal]
  40. Lutz Volkmann
    On cycles in regular 3-partite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1198-1206 [Journal]
  41. Lutz Volkmann, Stefan Winzen
    Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:217-229 [Journal]
  42. Lutz Volkmann, Stefan Winzen
    Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:267-278 [Journal]
  43. Lutz Volkmann, Anders Yeo
    Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:267-276 [Journal]
  44. Lutz Volkmann, Vadim E. Zverovich
    A disproof of Henning's conjecture on irredundance perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:539-554 [Journal]
  45. Meike Tewes, Lutz Volkmann
    The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:453-457 [Journal]
  46. Meike Tewes, Lutz Volkmann, Anders Yeo
    Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:201-228 [Journal]
  47. Lutz Volkmann
    Longest paths through an arc in strong semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:331-337 [Journal]
  48. Lutz Volkmann
    Cycles in multipartite tournaments: results and problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:19-53 [Journal]
  49. Lutz Volkmann
    All regular multipartite tournaments that are cycle complementary. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:255-266 [Journal]
  50. Lutz Volkmann
    Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:359-364 [Journal]
  51. Lutz 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]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:193-194 [Journal]
  52. Mostafa Blidia, Mustapha Chellali, Lutz Volkmann
    Some bounds on the p-domination number in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:17, pp:2031-2037 [Journal]
  53. Lutz Volkmann, Stefan Winzen
    Paths with a given number of vertices from each partite set in regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:21, pp:2724-2732 [Journal]
  54. Lutz Volkmann
    Longest cycles in almost regular 3-partite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:22, pp:2931-2942 [Journal]
  55. Arne Hoffmann, Lutz Volkmann
    Structural Remarks on Bipartite Graphs with Unique f-Factors. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:421-425 [Journal]
  56. Yubao Guo, Lutz Volkmann
    Extendable Cycles in Multipartite Tournaments. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:185-190 [Journal]
  57. Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
    Note on the connectivity of line graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:1, pp:7-10 [Journal]
  58. Angelika Hellwig, Lutz Volkmann
    Lower bounds on the vertex-connectivity of digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:2, pp:41-46 [Journal]
  59. Paul Butzer, Lutz Volkmann
    Otto Blumenthal (1876-1944) in retrospect. [Citation Graph (0, 0)][DBLP]
    Journal of Approximation Theory, 2006, v:138, n:1, pp:1-36 [Journal]
  60. Yubao Guo, Lutz Volkmann
    Cycles in Multipartite Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:363-366 [Journal]
  61. Yubao Guo, Lutz Volkmann
    A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:140-145 [Journal]
  62. Angelika Hellwig, Lutz Volkmann
    Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:3, pp:228-246 [Journal]
  63. Angelika Hellwig, Lutz Volkmann
    On connectivity in graphs with given clique number. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:1, pp:7-14 [Journal]
  64. Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
    On the connectivity of diamond-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2111-2117 [Journal]
  65. Peter Flach, Lutz Volkmann
    Estimations for the domination number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:145-151 [Journal]
  66. Bert Randerath, Lutz Volkmann
    Characterization of graphs with equal domination and covering number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:159-169 [Journal]
  67. Meike Tewes, Lutz Volkmann
    Vertex deletion and cycles in multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:769-779 [Journal]
  68. Dieter Rautenbach, Lutz Volkmann
    The domatic number of block-cactus graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:185-193 [Journal]
  69. Lutz Volkmann
    The ratio of the irredundance and domination number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:178, n:1-3, pp:221-228 [Journal]
  70. Yubao Guo, Axel Pinkernell, Lutz Volkmann
    On cycles through a given vertex in multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:165-170 [Journal]
  71. Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann
    A classification of locally semicomplete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:101-114 [Journal]
  72. Jerzy Topp, Lutz Volkmann
    On graphs with equal domination and independent domination numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:1, pp:75-80 [Journal]
  73. Jerzy Topp, Lutz Volkmann
    On packing and covering numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:229-238 [Journal]
  74. Jerzy Topp, Lutz Volkmann
    Some upper bounds for the product of the domination number and the chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:289-292 [Journal]
  75. Peter Maschlanka, Lutz Volkmann
    Independence number in n-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:167-178 [Journal]
  76. Werner Siemes, Jerzy Topp, Lutz Volkmann
    On unique independent sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:279-285 [Journal]
  77. Yubao Guo, Lutz Volkmann
    On complementary cycles in locally semicomplete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:135, n:1-3, pp:121-127 [Journal]
  78. Lutz Volkmann
    Restricted arc-connectivity of digraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:234-239 [Journal]

  79. A remark on cycles through an arc in strongly connected multipartite tournaments. [Citation Graph (, )][DBLP]


  80. On local connectivity of graphs. [Citation Graph (, )][DBLP]


  81. Some remarks on the signed domatic number of graphs with small minimum degree. [Citation Graph (, )][DBLP]


  82. The Roman domatic number of a graph. [Citation Graph (, )][DBLP]


  83. On the order of close to regular graphs without a matching of given size. [Citation Graph (, )][DBLP]


  84. How close to regular must a multipartite tournament be to secure a given path covering number? [Citation Graph (, )][DBLP]


  85. Upper bounds on the domination number of a graph in terms of order and minimum degree. [Citation Graph (, )][DBLP]


  86. Average distance in bipartite tournaments. [Citation Graph (, )][DBLP]


  87. Distance Domination and Distance Irredundance in Graphs. [Citation Graph (, )][DBLP]


  88. A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs. [Citation Graph (, )][DBLP]


  89. The connectivity of a graph and its complement. [Citation Graph (, )][DBLP]


  90. Upper bounds on the k-domination number and the k-Roman domination number. [Citation Graph (, )][DBLP]


  91. The signed domatic number of some regular graphs. [Citation Graph (, )][DBLP]


  92. Signed star domatic number of a graph. [Citation Graph (, )][DBLP]


  93. Multipartite tournaments: A survey. [Citation Graph (, )][DBLP]


  94. Strongly 4-path-connectivity in almost regular multipartite tournaments. [Citation Graph (, )][DBLP]


  95. Local-edge-connectivity in digraphs and oriented graphs. [Citation Graph (, )][DBLP]


  96. Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. [Citation Graph (, )][DBLP]


  97. Maximally edge-connected and vertex-connected graphs and digraphs: A survey. [Citation Graph (, )][DBLP]


  98. Strong subtournaments containing a given vertex in regular multipartite tournaments. [Citation Graph (, )][DBLP]


  99. On arc-traceable local tournaments. [Citation Graph (, )][DBLP]


  100. Some remarks on lambdap, q-connectedness. [Citation Graph (, )][DBLP]


  101. On graphs with equal domination and 2-domination numbers. [Citation Graph (, )][DBLP]


  102. All 2-connected in-tournaments that are cycle complementary. [Citation Graph (, )][DBLP]


  103. alpha-Domination perfect trees. [Citation Graph (, )][DBLP]


  104. Complementary cycles in regular multipartite tournaments, where one cycle has length five. [Citation Graph (, )][DBLP]


  105. Every cycle-connected multipartite tournament has a universal arc. [Citation Graph (, )][DBLP]


  106. On the existence of edge cuts leaving several large components. [Citation Graph (, )][DBLP]


  107. On the number of cycles in local tournaments. [Citation Graph (, )][DBLP]


  108. On the connectivity of p-diamond-free graphs. [Citation Graph (, )][DBLP]


  109. Parity and disparity subgraphs. [Citation Graph (, )][DBLP]


  110. Inverse degree and edge-connectivity. [Citation Graph (, )][DBLP]


  111. Cycle factors in strongly connected local tournaments. [Citation Graph (, )][DBLP]


  112. On the geodetic and geodetic domination numbers of a graph. [Citation Graph (, )][DBLP]


Search in 0.053secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002