The following pages link to Lutz Volkmann (Q186197):
Displaying 50 items.
- Longest cycles in almost regular 3-partite tournaments (Q860458) (← links)
- On integer domination in graphs and Vizing-like problems (Q861441) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- On an extremal problem related to a theorem of Whitney (Q869580) (← links)
- Orthogonal double covers of complete graphs by caterpillars of diameter 5 (Q879946) (← links)
- Upper bounds on the signed total \((k, k)\)-domatic number of graphs (Q891310) (← links)
- On the signed (total) \(k\)-independence number in graphs (Q891311) (← links)
- Estimations for the domination number of a graph (Q912870) (← links)
- \(\alpha \)-domination perfect trees (Q932588) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- Large sets of Hamilton cycle decompositions of complete bipartite graphs (Q932831) (← links)
- Connectivity keeping edges in graphs with large minimum degree (Q933682) (← links)
- Extra edge connectivity and isoperimetric edge connectivity (Q941400) (← links)
- Ore-condition and \(Z_3\)-connectivity (Q942129) (← links)
- The extremal function for 3-linked graphs (Q947723) (← links)
- A weaker version of Lovász' path removal conjecture (Q947724) (← links)
- Connectivity measures in matched sum graphs (Q952660) (← links)
- Cycle factors in strongly connected local tournaments (Q965966) (← links)
- Signed star domatic number of a graph (Q968131) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- Minimum size of a graph or digraph of given radius (Q989544) (← links)
- The roman domatic number of a graph (Q990809) (← links)
- On arc-traceable local tournaments (Q998389) (← links)
- Strong subtournaments containing a given vertex in regular multipartite tournaments (Q998431) (← links)
- Some remarks on \(\lambda _{p,q}\)-connectedness (Q998437) (← links)
- The connectivity of a graph and its complement (Q1003479) (← links)
- Every cycle-connected multipartite tournament has a universal arc (Q1011750) (← links)
- 2-domination subdivision number of graphs (Q1011881) (← links)
- A remark on degree sequences of multigraphs (Q1014317) (← links)
- On the existence of edge cuts leaving several large components (Q1024487) (← links)
- On the number of cycles in local tournaments (Q1025457) (← links)
- Parity and disparity subgraphs (Q1025535) (← links)
- Complementary cycles in regular multipartite tournaments, where one cycle has length five (Q1025933) (← links)
- The signed domatic number of some regular graphs (Q1026154) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- Degree sequence conditions for maximally edge-connected oriented graphs (Q1031725) (← links)
- Some remarks on the signed domatic number of graphs with small minimum degree (Q1033055) (← links)
- Inverse degree and edge-connectivity (Q1043655) (← links)
- On the connectivity of \(p\)-diamond-free graphs (Q1045100) (← links)
- On the characterization of the function \(f(x)=x\) by functional equations. II (Q1074796) (← links)
- Untersuchungen ganzer und meromorpher Funktionen unendlicher Ordnung (Q1159784) (← links)
- On graphs with equal domination and independent domination numbers (Q1182987) (← links)
- On packing and covering numbers of graphs (Q1185083) (← links)
- Über Zusammenhänge zwischen den Nullstellen und dem Zentralindex ganzer Funktionen (Q1213999) (← links)
- Zusammenhänge zwischen dem Maximalbetrag und einer Nullstellenfunktion bei ganzen Funktionen (Q1240343) (← links)
- Vertex deletion and cycles in multipartite tournaments (Q1292878) (← links)
- Longest paths in semicomplete multipartite digraphs (Q1297460) (← links)
- On graphs with equal domination and covering numbers (Q1329822) (← links)
- On unique independent sets in graphs (Q1331985) (← links)
