The following pages link to (Q3277097):
Displaying 50 items.
- Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
- Edge criticality in graph domination (Q295267) (← links)
- Scales and methods for deriving weights in the analytic hierarchy process (Q357757) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Independent protection in graphs (Q400447) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- The cycles approach (Q451056) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- The cardinality of the collection of maximum independent sets of a functional graph (Q678609) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- A relativized measure of circularity for tournaments (Q690089) (← links)
- A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
- On large sets of disjoint Steiner triple systems. IV (Q797587) (← links)
- Variation on a theorem of König (Q797595) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Classes of cycle bases (Q868389) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Probabilistic inference in multiply connected belief networks using loop cutsets (Q911806) (← links)
- On the independent queens covering problem (Q921006) (← links)
- Nomadic decompositions of bidirected complete graphs (Q932653) (← links)
- Graph-theoretic methods for the analysis of chemical and biochemical networks. I. Multistability and oscillations in ordinary differential equation models (Q938072) (← links)
- Total restrained domination in graphs with minimum degree two (Q952652) (← links)
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (Q967326) (← links)
- On the domination number of generalized petersen graphs \(P(n,2)\) (Q1025503) (← links)
- A survey of stratified domination in graphs (Q1045116) (← links)
- Generic properties of column-structured matrices (Q1057344) (← links)
- Domination parameters for the bishops graph (Q1081616) (← links)
- On some counting polynomials in chemistry (Q1095908) (← links)
- Toroidal tilings from de Bruijn-Good cyclic sequences (Q1106852) (← links)
- On a class of matrices with real eigenvalues (Q1117287) (← links)
- De Bruijn sequences, irreducible codes and cyclotomy (Q1126191) (← links)
- Complexity of problems in games, graphs and algebraic equations (Q1137948) (← links)
- The frequency of cyclic processes in biological multistate systems (Q1139329) (← links)
- The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\) (Q1142713) (← links)
- Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs (Q1149373) (← links)
- Nonexistence of seven-dimensional tangential 2-blocks (Q1157009) (← links)
- Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
- The complexity of social groups and social systems described by graph structures (Q1166391) (← links)
- Chessboard domination problems (Q1174120) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Cycles in extensive form perfect information games (Q1176957) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Redundant networks and minimum distance (Q1211947) (← links)
