The following pages link to (Q4211751):
Displaying 17 items.
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice (Q283197) (← links)
- The forcing vertex detour monophonic number of a graph (Q322058) (← links)
- The \((a,b)\)-forcing geodetic graphs (Q1024478) (← links)
- The forcing hull and forcing geodetic numbers of graphs (Q1028447) (← links)
- Research problems from the 19th British Combinatorial Conference (Q1779507) (← links)
- On the forcing domination and the forcing total domination numbers of a graph (Q2165253) (← links)
- The restrained geodetic number of a graph (Q2350702) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- The lower and upper forcing geodetic numbers of block--cactus graphs (Q2432848) (← links)
- FORCING DOMINATION NUMBERS OF GRAPHS UNDER SOME BINARY OPERATIONS (Q4973400) (← links)
- FORCING SUPER DOMINATION NUMBER OF A GRAPH (Q4973408) (← links)
- The forcing nonsplit domination number of a graph (Q5006062) (← links)
- On the forcing connected domination number of a graph (Q5069911) (← links)
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH (Q5075602) (← links)
- Complete forcing numbers of complete and almost-complete multipartite graphs (Q6053962) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)
- THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH (Q6149009) (← links)
