Pages that link to "Item:Q385486"
From MaRDI portal
The following pages link to Roman domination on strongly chordal graphs (Q385486):
Displaying 15 items.
- Global total Roman domination in graphs (Q5370823) (← links)
- Linear programming approach for various domination parameters (Q5859511) (← links)
- On the total Roman domination stability in graphs (Q5861706) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Total Roman domination on the digraphs (Q6049701) (← links)
- Hardness results of global Roman domination in graphs (Q6069177) (← links)
- Total Italian domatic number of graphs (Q6074037) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- Quasi-total Roman bondage number in graphs (Q6101467) (← links)
- Quasi-total Roman reinforcement in graphs (Q6110872) (← links)
- (Q6149330) (← links)
- Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles (Q6550939) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)