Pages that link to "Item:Q839753"
From MaRDI portal
The following pages link to Domination number in graphs with minimum degree two (Q839753):
Displaying 18 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- New results on \(k\)-independence of graphs (Q528993) (← links)
- Labelings of plane graphs containing Hamilton path (Q546299) (← links)
- A new bound on the domination number of graphs with minimum degree two (Q625374) (← links)
- Super \(d\)-antimagic labelings of disconnected plane graphs (Q627559) (← links)
- An upper bound on the domination number of a graph with minimum degree 2 (Q1011694) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Domination numbers of undirected toroidal mesh (Q1757999) (← links)
- The limit case of a domination property (Q1758000) (← links)
- Strong labelings of linear forests (Q2266841) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
- Domination in graphs of minimum degree five (Q2494122) (← links)
- Domination number of graphs with minimum degree five (Q2656332) (← links)
- On a relationship between 2-dominating and 5-dominating sets in graphs (Q2768130) (← links)
- Domination in graphs with minimum degree two (Q3490039) (← links)
- Bounds related to domination in graphs with minimum degree two (Q4344216) (← links)
- (Q5863477) (← links)
