The following pages link to E. J. Farrell (Q579279):
Displaying 47 items.
- Counting matchings in graphs (Q579280) (← links)
- Matchings in hexagonal cacti (Q579281) (← links)
- On F-polynomials of thistles (Q579282) (← links)
- Matchings in benzene chains (Q594902) (← links)
- Forest decompositions of graphs with cyclomatic number 3 (Q790822) (← links)
- Matchings in pentagonal chains (Q791538) (← links)
- Path decompositions of chains and circuits (Q793050) (← links)
- On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs (Q795840) (← links)
- On star polynomials, graphical partitions and reconstruction (Q921015) (← links)
- On coefficients of circuit polynomials and characteristic polynomials (Q1078182) (← links)
- Matching polynomials: A matrix approach and its applications (Q1086253) (← links)
- Some general classes of comatching graphs (Q1092933) (← links)
- On star polynomials of complements of graphs (Q1123894) (← links)
- Chromatic roots - some observations and conjectures (Q1144033) (← links)
- On chromatic coefficients (Q1144034) (← links)
- Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 (Q1147718) (← links)
- A result on co-chromatic graphs (Q1150626) (← links)
- Cycle decompositions of complete graphs (Q1160189) (← links)
- A generalization of the dichromatic polynomial of a graph (Q1160196) (← links)
- A note on the circuit polynomials and characteristic polynomials of wheels and ladders (Q1163037) (← links)
- An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers (Q1187591) (← links)
- On the theory of matching equivalent graphs and rook equivalent chessboards (Q1188070) (← links)
- Connections between the matching and chromatic polynomials (Q1205617) (← links)
- On a general class of graph polynomials (Q1226488) (← links)
- An introduction to matching polynomials (Q1229232) (← links)
- On graphical partitions and planarity (Q1237749) (← links)
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs (Q1255017) (← links)
- The matching polynomial of a regular graph (Q1343771) (← links)
- On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796) (← links)
- Forest decompositions of ladders (Q1837696) (← links)
- Forest decompositions of graphs with cyclomatic number 2 (Q1837697) (← links)
- The matching polynomial of a distance-regular graph (Q1975936) (← links)
- On coefficients of path polynomials (Q2266721) (← links)
- On the matching polynomial and its relation to the rook polynomial (Q2639072) (← links)
- On a class of polynomials associated with the cliques in a graph and its applications (Q2639073) (← links)
- (Q2707950) (← links)
- (Q2951142) (← links)
- (Q2978288) (← links)
- (Q3027054) (← links)
- (Q3039384) (← links)
- (Q3041231) (← links)
- (Q3048877) (← links)
- (Q3139760) (← links)
- (Q3312274) (← links)
- (Q3328577) (← links)
- (Q3329509) (← links)
- (Q3413875) (← links)
