The following pages link to (Q3684150):
Displayed 16 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Dominating cycles in Halin graphs (Q1174137) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- \(H\)-domination in graphs (Q1415548) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs (Q3439140) (← links)
- (Q5708558) (← links)