This map shows the geographic impact of Lou Caccetta's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lou Caccetta with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lou Caccetta more than expected).
This network shows the impact of papers produced by Lou Caccetta. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lou Caccetta. The network helps show where Lou Caccetta may publish in the future.
Co-authorship network of co-authors of Lou Caccetta
This figure shows the co-authorship network connecting the top 25 collaborators of Lou Caccetta.
A scholar is included among the top collaborators of Lou Caccetta based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Lou Caccetta. Lou Caccetta is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Caccetta, Lou, et al.. (2016). Critical graphs with respect to total domination and connected domination. eSpace (Curtin University). 65(1). 1–13.1 indexed citations
Caccetta, Lou, et al.. (1995). A note on k-extendable graphs and independence number.. Australas. J Comb.. 12. 59–66.1 indexed citations
7.
Caccetta, Lou, et al.. (1994). On the existence of almost-regular- graphs without one-factors.. Australas. J Comb.. 9. 243–260.3 indexed citations
8.
Caccetta, Lou, et al.. (1994). On constructing graphs with a prescribed adjacency property.. Australas. J Comb.. 10. 73–84.2 indexed citations
9.
Achuthan, N. R., et al.. (1994). Computational methods for the diameter restricted minimum weight spanning tree problem.. Australas. J Comb.. 10. 51–72.36 indexed citations
10.
Caccetta, Lou, et al.. (1993). On strongly edge-critical graphs of given diameter.. Australas. J Comb.. 8. 99–122.3 indexed citations
11.
Caccetta, Lou, et al.. (1993). On graphs satisfying a strong adacency property.. Australas. J Comb.. 8. 153–168.1 indexed citations
12.
Achuthan, N. R. & Lou Caccetta. (1993). Addendum: Minimum weight spanning trees with bounded diameter.. Australas. J Comb.. 8. 279.2 indexed citations
13.
Achuthan, N. R. & Lou Caccetta. (1992). MINIMUM WEIGHT SPANNING TREES WITH BOUNDED DIAMETER. Australas. J Comb.. 5. 261–276.6 indexed citations
14.
Caccetta, Lou, et al.. (1992). Premature sets of one-factors.. Australas. J Comb.. 5. 229–252.5 indexed citations
15.
Caccetta, Lou, et al.. (1992). Graphs with a prescribed adjacency property.. Australas. J Comb.. 6. 155–176.3 indexed citations
16.
Caccetta, Lou, et al.. (1992). On critically k-extendable graphs.. Australas. J Comb.. 6. 39–66.2 indexed citations
Caccetta, Lou, et al.. (1990). On maximal sets of one-factors.. Australas. J Comb.. 1. 5–14.1 indexed citations
19.
Caccetta, Lou & Purwanto Purwanto. (1990). Deficiencies and vertex clique covering numbers of a family of trees.. Australas. J Comb.. 1. 15–28.1 indexed citations
20.
Achuthan, N. R., et al.. (1990). On the Nordhaus-Gaddum class problems.. Australas. J Comb.. 2. 5–28.4 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.