The following pages link to Lutz Volkmann (Q186197):
Displayed 50 items.
- New bounds on the signed total domination number of graphs (Q274707) (← links)
- Lower bounds on the signed total \(k\)-domination number of graphs (Q284687) (← links)
- Edge-removal and edge-addition in \(\alpha \)-domination (Q293651) (← links)
- Signed Roman \(k\)-domination in digraphs (Q293661) (← links)
- On the signed total Roman domination and domatic numbers of graphs (Q317425) (← links)
- Total restrained reinforcement in graphs (Q322041) (← links)
- Signed total Roman domination in graphs (Q326484) (← links)
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- The roman \(k\)-domatic number of a graph (Q353534) (← links)
- Upper bounds on the signed (\(k, k\))-domatic number (Q387615) (← links)
- (Q400537) (redirect page) (← links)
- The \(k\)-rainbow bondage number of a graph (Q400538) (← links)
- The total \(\{k\}\)-domatic number of a graph (Q421274) (← links)
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected (Q444443) (← links)
- The signed Roman \(k\)-domatic number of a graph (Q476316) (← links)
- Signed Roman domination in digraphs (Q498421) (← links)
- Signed total Roman domination in digraphs (Q503685) (← links)
- Signed Roman edge \(k\)-domination in graphs (Q505464) (← links)
- Roman game domination number of a graph (Q511720) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- Upper bounds on the signed total domatic number of graphs (Q534350) (← links)
- Signed total \((k,k)\)-domatic number of a graph (Q547554) (← links)
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph (Q550486) (← links)
- On average lower independence and domination numbers in graphs (Q556830) (← links)
- Smallest close to regular bipartite graphs without an almost perfect matching (Q606288) (← links)
- Bounds on the signed domatic number (Q609986) (← links)
- The diameter of almost Eulerian digraphs (Q612941) (← links)
- The signed \(k\)-domination number of directed graphs (Q632269) (← links)
- Roman domination dot-critical trees (Q647236) (← links)
- The \((j,k)\)-domatic number of a graph (Q656137) (← links)
- On the Roman \(k\)-bondage number of a graph (Q656138) (← links)
- Signed 2-independence in digraphs (Q658077) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Signed total \((k,k)\)-domatic number of digraphs (Q662374) (← links)
- Some upper bounds for the product of the domination number and the chromatic number of a graph (Q685554) (← links)
- A note on reducible cycles in multipartite tournaments (Q698553) (← links)
- Distance between two vertices of maximum matching graphs (Q705048) (← links)
- The maximum size of graphs with a unique \(k\)-factor (Q705753) (← links)
- The \(\{k\}\)-domatic number of a graph (Q719648) (← links)
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs (Q730486) (← links)
- Upper bounds on the signed \((k,k)\)-domatic number of digraphs (Q745940) (← links)
- Wachstumseigenschaften ganzer Funktionen mit negativen Nullstellen (Q792483) (← links)
- Wachstumsverhalten zusammengesetzter Funktionen (Q798795) (← links)
- Spanning trails containing given edges (Q817757) (← links)
- Connectivity of Cartesian product graphs (Q817765) (← links)
- Otto Blumenthal (1876--1944) in retrospect (Q818452) (← links)
- Lower bounds on the vertex-connectivity of digraphs and graphs (Q845669) (← links)
- 3-restricted edge cut of graphs (Q854600) (← links)
- Hamilton cycles in digraphs of unitary matrices (Q856886) (← links)