Pages that link to "Item:Q4175592"
From MaRDI portal
The following pages link to Properties of Hereditary Hypergraphs and Middle Graphs (Q4175592):
Displayed 36 items.
- A lower bound for the CO-irredundance number of a graph (Q556836) (← links)
- Irredundancy in circular arc graphs (Q686248) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- The irredundance number and maximum degree of a graph (Q793760) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Queen's domination using border squares and \((A,B)\)-restricted domination (Q942117) (← links)
- On the product of upper irredundance numbers of a graph and its complement (Q1119604) (← links)
- Some inequalities about connected domination number (Q1126207) (← links)
- Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- Irredundance number versus domination number (Q1176738) (← links)
- Minus domination in graphs (Q1297430) (← links)
- On the differences between the upper irredundance, upper domination and independence numbers of a graph (Q1301668) (← 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)
- Domination and irredundance in cubic graphs (Q1356461) (← links)
- Gallai-type theorems and domination parameters (Q1356464) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Irredundance in grids (Q1377729) (← links)
- Domination by queens on a square beehive (Q1377840) (← links)
- Stratification and domination in graphs (Q1412664) (← links)
- Independence and upper irredundance in claw-free graphs (Q1414584) (← links)
- Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- Interpolation theorems for domination numbers of a graph (Q1584415) (← links)
- Inequalities relating domination parameters in cubic graphs (Q1815314) (← links)
- Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties (Q1883262) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Well irredundant graphs (Q1917235) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Extremal graphs for a new upper bound on domination parameters in graphs (Q2433699) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Irredundant ramsey numbers for graphs (Q3033791) (← links)
- THE IRREDUNDANT RAMSEY NUMBER s(3,6) (Q3487385) (← links)
- Irredundant ramsey numbers for graphs (Q4204177) (← links)
- (Q4242732) (← links)