The following pages link to (Q4123349):
Displayed 8 items.
- Graphs whose vertex independence number is unaffected by single edge addition or deletion (Q689974) (← links)
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time (Q1747105) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- The Private Neighbor Concept (Q3384113) (← links)