Pages that link to "Item:Q2757494"
From MaRDI portal
The following pages link to Defendens Imperium Romanum: A Classical Problem in Military Strategy (Q2757494):
Displaying 50 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Maximal 2-rainbow domination number of a graph (Q334128) (← links)
- Double Roman domination (Q335328) (← links)
- The roman \(k\)-domatic number of a graph (Q353534) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Roman game domination number of a graph (Q511720) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
- On the Roman domination subdivision number of a graph (Q782761) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- A note on Roman domination in graphs (Q856892) (← links)
- Process flexibility: design, evaluation, and applications (Q971985) (← links)
- The roman domatic number of a graph (Q990809) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Roman domination in regular graphs (Q1024464) (← links)
- On the Roman domination number of a graph (Q1025980) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- Independent Roman \(\{2 \}\)-domination in graphs (Q1693166) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- On the global Roman domination number in graphs (Q1708687) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- Signed double Roman domination in graphs (Q1730213) (← links)
- The Roman \(\{2 \}\)-domatic number of graphs (Q1732117) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Some progress on the restrained Roman domination (Q2021658) (← links)
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination (Q2025071) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401) (← links)
- Relating the outer-independent total Roman domination number with some classical parameters of graphs (Q2141037) (← links)
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number (Q2151206) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- Total Roman \(\{2\}\)-dominating functions in graphs (Q2151223) (← links)
- A new upper bound for the perfect Italian domination number of a tree (Q2151228) (← links)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499) (← links)
- Bounds on the double Italian domination number of a graph (Q2158195) (← links)
