Edward J. Farrell

According to our database1, Edward J. Farrell authored at least 25 papers between 1962 and 2016.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
D-Graphs For Graphs With Cyclomatic Number 1.
Ars Comb., 2016

1995
The matching polynomial of a regular graph.
Discret. Math., 1995

1992
A Modeling Study of the North Atlantic with Emphasis on the Greenland-Iceland-Norwegian Sea.
IBM Syst. J., 1992

1991
Visual interpretation of multidimensional computations and transistor design.
IBM J. Res. Dev., 1991

Preface.
IBM J. Res. Dev., 1991

On matching coefficients.
Discret. Math., 1991

1987
Visual Interpretation of Complex Data.
IBM Syst. J., 1987

1985
Animation and 3D Color Display of Multiple-Variable Data: Application to Semiconductor Design.
IBM J. Res. Dev., 1985

Animated 3D CT Imaging.
IEEE Computer Graphics and Applications, 1985

1984
Matchings in pentagonal chains.
Discret. Appl. Math., 1984

Matchings in benzene chains.
Discret. Appl. Math., 1984

Color 3-D Imaging of Normal and Pathologic Intracranial Structures.
IEEE Computer Graphics and Applications, 1984

1983
Color Display and Interactive Interpretation of Three-Dimensional Data.
IBM J. Res. Dev., 1983

Forest decompositions of ladders.
Discret. Math., 1983

1982
A note on the circuit polynomials and characteristic polynomials of wheels and ladders.
Discret. Math., 1982

Cycle decompositions of complete graphs.
Discret. Math., 1982

1981
Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2.
Discret. Math., 1981

1980
On chromatic coefficients.
Discret. Math., 1980

Chromatic roots - some observations and conjectures.
Discret. Math., 1980

1979
On a general class of graph polynomials.
J. Comb. Theory B, 1979

An introduction to matching polynomials.
J. Comb. Theory B, 1979

On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs.
Discret. Math., 1979

1977
On graphical partitions and planarity.
Discret. Math., 1977

1966
Minimum length matched filters for digital applications (Corresp.).
IEEE Trans. Inf. Theory, 1966

1962
Computer design: Applications of redundancy to improve the accuracy of binary systems.
Proceedings of the 1962 ACM national conference, Digest of technical papers, 1962


  Loading...