E. J. Cockayne

From MaRDI portal
Person:189720

Available identifiers

zbMath Open cockayne.ernest-jWikidataQ102168925 ScholiaQ102168925MaRDI QIDQ189720

List of research outcomes





PublicationDate of PublicationType
On \(i\)-minus-edge-removal-critical graphs2016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q35816852010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35659452010-06-07Paper
Open irredundance and maximum degree in graphs2009-01-28Paper
Claw-free graphs are not universal fixers2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q55033362009-01-15Paper
https://portal.mardi4nfdi.de/entity/Q35072652008-06-18Paper
OC-irredundance, CO-irredundance and maximum degree in trees2008-06-18Paper
Irredundance, secure domination and maximum degree in trees2007-02-02Paper
https://portal.mardi4nfdi.de/entity/Q54883462006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883402006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54807262006-08-03Paper
https://portal.mardi4nfdi.de/entity/Q54634732005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54616852005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54609002005-07-20Paper
https://portal.mardi4nfdi.de/entity/Q46595942005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q48262802004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48261832004-11-11Paper
Generalised irredundance in graphs: Nordhaus-Gaddum bounds2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48208382004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48129252004-08-23Paper
https://portal.mardi4nfdi.de/entity/Q44575572004-03-25Paper
Roman domination in graphs.2004-03-14Paper
On \(i^{-}\)-ER-critical graphs2004-02-14Paper
Changing upper irredundance by edge addition2003-06-09Paper
https://portal.mardi4nfdi.de/entity/Q47985322003-05-20Paper
Irredundance-edge-removal-critical graphs2003-03-18Paper
Vertices contained in all or in no minimum total dominating set of a tree2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q45521992002-08-29Paper
Ramsey properties of generalised irredundant sets in graphs2002-01-08Paper
Queens graphs for chessboards on the torus2002-01-02Paper
Properties of queens graphs and the irredundance number of \(Q_7\)2001-08-12Paper
Extremal graphs for inequalities involving domination parameters2001-02-05Paper
https://portal.mardi4nfdi.de/entity/Q49435312000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q45060682000-11-29Paper
Irredundant and perfect neighbourhood sets in trees2000-11-02Paper
Nordhaus-Gaddum results for CO-irredundance in graphs2000-07-27Paper
https://portal.mardi4nfdi.de/entity/Q49435102000-03-16Paper
On 1-dependent ramsey numbers for graphs1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42220901999-07-19Paper
An inequality chain of domination parameters for trees1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q43786361999-02-11Paper
https://portal.mardi4nfdi.de/entity/Q42117551998-10-07Paper
Using maximality and minimality conditions to construct inequality chains1998-05-06Paper
https://portal.mardi4nfdi.de/entity/Q43786261998-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43677851998-02-22Paper
https://portal.mardi4nfdi.de/entity/Q43747061998-01-25Paper
Domination and irredundance in cubic graphs1997-10-29Paper
https://portal.mardi4nfdi.de/entity/Q43615681997-10-28Paper
Domination and irredundance in the queens' graph1997-10-26Paper
https://portal.mardi4nfdi.de/entity/Q43430511997-10-07Paper
Irredundance and Maximum Degree in Graphs1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q48949981997-01-26Paper
Universal maximal packing functions of graphs1996-12-08Paper
https://portal.mardi4nfdi.de/entity/Q48791601996-07-08Paper
https://portal.mardi4nfdi.de/entity/Q48651381996-06-27Paper
https://portal.mardi4nfdi.de/entity/Q48622161996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48736931996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48537521995-11-01Paper
https://portal.mardi4nfdi.de/entity/Q46975801995-10-23Paper
A characterisation of universal minimal total dominating functions in trees1995-07-24Paper
On a Nordhaus-Gaddum type problem for independent domination1995-04-17Paper
The irredundant ramsey number s(3,3,3) = 131995-02-28Paper
Total dominating functions in trees: Minimality and convexity1995-02-01Paper
Universal minimal total dominating functions in graphs1995-01-19Paper
https://portal.mardi4nfdi.de/entity/Q43091111994-12-05Paper
Convexity of minimal dominating functions of trees. II1994-08-07Paper
CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY1994-04-21Paper
The sequence of upper and lower domination, independence and irredundance numbers of a graph1994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q40143121992-10-06Paper
https://portal.mardi4nfdi.de/entity/Q39870511992-06-28Paper
Improved computation of plane Steiner minimal trees1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870401992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39805541992-06-26Paper
The product of the independent domination numbers of a graph and its complement1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39746901992-06-25Paper
Chessboard domination problems1992-06-25Paper
On generalised minimal domination parameters for paths1992-06-25Paper
Atom probe tomography characterization of solute segregation to dislocations and interfaces1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33513931991-01-01Paper
THE IRREDUNDANT RAMSEY NUMBER s(3,6)1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31994501990-01-01Paper
Irredundant ramsey numbers for graphs1989-01-01Paper
On the product of upper irredundance numbers of a graph and its complement1989-01-01Paper
Irredundant ramsey numbers for graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047291988-01-01Paper
Gallai theorems for graphs, hypergraphs, and set systems1988-01-01Paper
On the independent queens covering problem1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38191041987-01-01Paper
On the diagonal queens domination problem1986-01-01Paper
Exact computation of Steiner minimal trees in the plane1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588831985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37088411984-01-01Paper
The irredundance number and maximum degree of a graph1984-01-01Paper
Rotation numbers for unions of circuits1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33294941983-01-01Paper
Rotation Numbers for Unions of Triangles and Circuits1983-01-01Paper
Ordered colourings of graphs1982-01-01Paper
More rotation numbers for complete bipartite graphs1982-01-01Paper
Information Dissemination in Trees1981-01-01Paper
Total domination in graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39046441980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39328281980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38597951979-01-01Paper
Graph-theoretic parameters concerning domination, independence, and irredundance1979-01-01Paper
Matchings and transversals in hypergraphs, domination and independence in trees1979-01-01Paper
Linear algorithms on recursive representations of trees1979-01-01Paper
On the sum of cardinalities of extremum maximal independent sets1979-01-01Paper
An algorithm for the most economic link addition in a tree communications network1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000751978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41632621978-01-01Paper
Disjoint cliques in regular graphs of degree seven and eight1978-01-01Paper
A linear algorithm for disjoint matchings in trees1978-01-01Paper
Towards a theory of domination in graphs1977-01-01Paper
Computation of Dominating Partitions1977-01-01Paper
Edge partitions of complete multipartite graphs into equal length circuits1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40717721976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40934841976-01-01Paper
Disjoint independent dominating sets in graphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41282851976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41035451976-01-01Paper
A linear algorithm for the domination number of a tree1975-01-01Paper
The Ramsey number for stripes1975-01-01Paper
Plane Motion of a Particle Subject to Curvature Constraints1975-01-01Paper
On Ramsey Graph Numbers for Stars and Stripes1975-01-01Paper
Some tree-star Ramsey numbers1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609851974-01-01Paper
Colour Classes for r-Graphs1972-01-01Paper
On Fermat's Problem on the Surface of a Sphere1972-01-01Paper
An interpolation theorem for partitions which are complete with respect to hereditary properties1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775021972-01-01Paper
On the Efficiency of the Algorithm for Steiner Minimal Trees1970-01-01Paper
An Application of Ramsey's Theorem1970-01-01Paper
Computation of Galois Group Elements of a Polynomial Equation1969-01-01Paper
Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon1969-01-01Paper
Balancing equal weights on the integer line1969-01-01Paper
Euclidean Constructibility in Graph-Minimization Problems1969-01-01Paper
Steiner’s problem for set-terminals1968-01-01Paper
Plane Pursuit with Curvature Constraints1967-01-01Paper
On the Steiner Problem1967-01-01Paper

Research outcomes over time

This page was built for person: E. J. Cockayne