The following pages link to E. J. Cockayne (Q189720):
Displaying 50 items.
- Matchings and transversals in hypergraphs, domination and independence in trees (Q599067) (← links)
- The irredundance number and maximum degree of a graph (Q793760) (← links)
- Gallai theorems for graphs, hypergraphs, and set systems (Q804601) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- On the independent queens covering problem (Q921006) (← links)
- Open irredundance and maximum degree in graphs (Q998417) (← links)
- Claw-free graphs are not universal fixers (Q998501) (← links)
- Ordered colourings of graphs (Q1052329) (← links)
- On the diagonal queens domination problem (Q1073797) (← links)
- Exact computation of Steiner minimal trees in the plane (Q1076029) (← links)
- On the product of upper irredundance numbers of a graph and its complement (Q1119604) (← links)
- Universal maximal packing functions of graphs (Q1126177) (← links)
- Chessboard domination problems (Q1174120) (← links)
- On generalised minimal domination parameters for paths (Q1174129) (← links)
- The product of the independent domination numbers of a graph and its complement (Q1179268) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- A linear algorithm for the domination number of a tree (Q1219556) (← links)
- Edge partitions of complete multipartite graphs into equal length circuits (Q1220088) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- Disjoint cliques in regular graphs of degree seven and eight (Q1242172) (← links)
- A linear algorithm for disjoint matchings in trees (Q1245850) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- On the sum of cardinalities of extremum maximal independent sets (Q1256488) (← links)
- An algorithm for the most economic link addition in a tree communications network (Q1259541) (← links)
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- Convexity of minimal dominating functions of trees. II (Q1322265) (← links)
- Domination and irredundance in cubic graphs (Q1356461) (← links)
- Domination and irredundance in the queens' graph (Q1356524) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- On \(i^{-}\)-ER-critical graphs (Q1422416) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- Extremal graphs for inequalities involving domination parameters (Q1567259) (← links)
- Irredundant and perfect neighbourhood sets in trees (Q1584343) (← links)
- Changing upper irredundance by edge addition (Q1810642) (← links)
- On a Nordhaus-Gaddum type problem for independent domination (Q1842161) (← links)
- Some tree-star Ramsey numbers (Q1844856) (← links)
- Vertices contained in all or in no minimum total dominating set of a tree (Q1861240) (← links)
- A characterisation of universal minimal total dominating functions in trees (Q1894760) (← links)
- Nordhaus-Gaddum results for CO-irredundance in graphs (Q1969790) (← links)
- An interpolation theorem for partitions which are complete with respect to hereditary properties (Q2562787) (← links)
- (Q2712529) (← links)
- (Q2760445) (← links)
- (Q2770447) (← links)
- (Q2816069) (← links)
- Irredundant ramsey numbers for graphs (Q3033791) (← links)
- (Q3199450) (← links)
- Graph-theoretic parameters concerning domination, independence, and irredundance (Q3208702) (← links)
- (Q3329494) (← links)
- Rotation numbers for unions of circuits (Q3331257) (← links)
- (Q3351393) (← links)
