The following pages link to (Q5753985):
Displaying 21 items.
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Integer and fractional packings in dense graphs (Q873647) (← links)
- Minimum fractional dominating functions and maximum fractional packing functions (Q1025952) (← links)
- Minus domination in graphs (Q1297430) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Fractional domination game (Q2327216) (← links)
- (Q2934714) (← links)
- The Private Neighbor Concept (Q3384113) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- Fractional Dominating Parameters (Q3384613) (← links)
- Integer and fractional packing of families of graphs (Q4667859) (← links)
- Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
