The following pages link to Pablo Torres (Q324773):
Displaying 18 items.
- Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
- \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- (Q1653048) (redirect page) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- A new Carleman inequality for a linear Schrödinger equation on some unbounded domains (Q2096956) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- The packing chromatic number of hypercubes (Q2352790) (← links)
- The automorphism group of the \(s\)-stable Kneser graphs (Q2360724) (← links)
- The packing coloring problem for lobsters and partner limited graphs (Q2448872) (← links)
- Polynomial instances of the Packing Coloring Problem (Q2840736) (← links)
- On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
- The Packing Coloring Problem for (q,q-4) Graphs (Q3167635) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
